./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e2602df4026b0f79436c89d73b6d392b42fc4f7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:03:23,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:03:23,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:03:23,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:03:23,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:03:23,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:03:23,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:03:23,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:03:23,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:03:23,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:03:23,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:03:23,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:03:23,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:03:23,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:03:23,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:03:23,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:03:23,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:03:23,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:03:23,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:03:23,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:03:23,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:03:23,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:03:23,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:03:23,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:03:23,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:03:23,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:03:23,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:03:23,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:03:23,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:03:23,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:03:23,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:03:23,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:03:23,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:03:23,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:03:23,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:03:23,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:03:23,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:03:23,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:03:23,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:03:23,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:03:23,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:03:23,741 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:03:23,788 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:03:23,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:03:23,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:03:23,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:03:23,791 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:03:23,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:03:23,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:03:23,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:03:23,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:03:23,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:03:23,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:03:23,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:03:23,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:03:23,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:03:23,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:03:23,796 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:03:23,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:03:23,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:03:23,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:03:23,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:03:23,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:03:23,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:03:23,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:03:23,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:03:23,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:03:23,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:03:23,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:03:23,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:03:23,799 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:03:23,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e2602df4026b0f79436c89d73b6d392b42fc4f7 [2020-11-30 01:03:24,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:03:24,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:03:24,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:03:24,142 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:03:24,143 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:03:24,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix004_power.oepc.i [2020-11-30 01:03:24,236 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/data/e0bde79c5/db8b6c8123f1447f986a30132747e008/FLAG58997c9b7 [2020-11-30 01:03:24,992 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:03:24,993 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/sv-benchmarks/c/pthread-wmm/mix004_power.oepc.i [2020-11-30 01:03:25,010 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/data/e0bde79c5/db8b6c8123f1447f986a30132747e008/FLAG58997c9b7 [2020-11-30 01:03:25,238 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/data/e0bde79c5/db8b6c8123f1447f986a30132747e008 [2020-11-30 01:03:25,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:03:25,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:03:25,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:03:25,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:03:25,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:03:25,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:03:25" (1/1) ... [2020-11-30 01:03:25,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f3d60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:25, skipping insertion in model container [2020-11-30 01:03:25,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:03:25" (1/1) ... [2020-11-30 01:03:25,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:03:25,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:03:25,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:03:25,901 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:03:25,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:03:26,110 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:03:26,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26 WrapperNode [2020-11-30 01:03:26,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:03:26,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:03:26,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:03:26,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:03:26,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:03:26,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:03:26,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:03:26,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:03:26,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... [2020-11-30 01:03:26,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:03:26,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:03:26,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:03:26,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:03:26,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:03:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:03:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 01:03:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:03:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:03:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 01:03:26,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 01:03:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 01:03:26,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 01:03:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 01:03:26,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 01:03:26,384 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-30 01:03:26,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-30 01:03:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:03:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 01:03:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:03:26,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:03:26,389 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 01:03:29,922 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:03:29,922 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 01:03:29,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:03:29 BoogieIcfgContainer [2020-11-30 01:03:29,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:03:29,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:03:29,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:03:29,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:03:29,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:03:25" (1/3) ... [2020-11-30 01:03:29,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7e6957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:03:29, skipping insertion in model container [2020-11-30 01:03:29,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:03:26" (2/3) ... [2020-11-30 01:03:29,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7e6957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:03:29, skipping insertion in model container [2020-11-30 01:03:29,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:03:29" (3/3) ... [2020-11-30 01:03:29,932 INFO L111 eAbstractionObserver]: Analyzing ICFG mix004_power.oepc.i [2020-11-30 01:03:29,945 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 01:03:29,945 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:03:29,950 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 01:03:29,951 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 01:03:29,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,992 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,992 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,993 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,994 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:29,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,004 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,005 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,005 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,009 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,009 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,009 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,009 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,009 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,010 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,010 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,010 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,010 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,010 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,011 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,011 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,011 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,011 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,011 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,020 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,021 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,029 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,029 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,030 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,032 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,033 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,033 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,035 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,036 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,037 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,037 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,037 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:03:30,044 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 01:03:30,056 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-30 01:03:30,088 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:03:30,089 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:03:30,089 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:03:30,089 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:03:30,089 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:03:30,089 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:03:30,090 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:03:30,090 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:03:30,109 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 01:03:30,112 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 125 transitions, 270 flow [2020-11-30 01:03:30,116 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 125 transitions, 270 flow [2020-11-30 01:03:30,118 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 135 places, 125 transitions, 270 flow [2020-11-30 01:03:30,206 INFO L129 PetriNetUnfolder]: 3/121 cut-off events. [2020-11-30 01:03:30,207 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 01:03:30,212 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-11-30 01:03:30,221 INFO L116 LiptonReduction]: Number of co-enabled transitions 3134 [2020-11-30 01:03:30,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:30,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:30,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:30,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:30,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:30,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:30,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:30,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 01:03:30,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:03:30,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:30,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:30,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:30,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:30,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:30,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:30,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:30,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:30,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:30,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:03:30,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:30,985 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-11-30 01:03:30,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:30,990 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-11-30 01:03:30,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:31,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:31,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:31,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:31,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:31,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:31,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:31,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:31,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:31,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:31,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:31,872 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-30 01:03:31,999 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-30 01:03:32,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:03:32,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:32,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:32,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:32,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:32,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:32,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:32,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:03:32,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:32,361 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-11-30 01:03:32,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:32,364 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-11-30 01:03:32,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:32,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:32,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 01:03:32,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:03:32,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:32,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:32,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:32,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:32,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:32,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:33,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:33,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:33,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:33,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:33,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:33,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:03:33,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,644 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-11-30 01:03:33,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,646 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-11-30 01:03:33,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:33,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 01:03:33,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:03:33,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:33,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:33,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:33,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:33,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:33,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:34,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:34,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 01:03:34,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-30 01:03:34,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:34,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:34,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-30 01:03:34,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:34,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-30 01:03:34,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 01:03:34,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:03:34,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,094 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-11-30 01:03:34,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,096 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-11-30 01:03:34,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,278 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-30 01:03:34,382 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-30 01:03:34,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:34,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:34,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:34,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:34,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:34,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:34,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:34,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:34,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:34,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:34,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:03:34,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:35,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:35,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:35,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:35,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:35,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:35,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 01:03:35,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:35,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 01:03:35,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:03:35,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:03:35,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:03:35,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:03:35,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:03:35,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:03:35,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-30 01:03:35,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:03:35,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-30 01:03:35,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:03:35,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:03:35,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:03:35,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:35,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 01:03:35,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:03:36,430 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 01:03:37,159 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-30 01:03:37,274 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-30 01:03:37,804 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2020-11-30 01:03:38,037 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-11-30 01:03:38,048 INFO L131 LiptonReduction]: Checked pairs total: 10098 [2020-11-30 01:03:38,048 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-30 01:03:38,054 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2020-11-30 01:03:38,687 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6914 states. [2020-11-30 01:03:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6914 states. [2020-11-30 01:03:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-30 01:03:38,696 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:38,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-30 01:03:38,698 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1255836, now seen corresponding path program 1 times [2020-11-30 01:03:38,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:38,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202290963] [2020-11-30 01:03:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:39,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202290963] [2020-11-30 01:03:39,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:39,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 01:03:39,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318033227] [2020-11-30 01:03:39,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:03:39,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:03:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:03:39,068 INFO L87 Difference]: Start difference. First operand 6914 states. Second operand 3 states. [2020-11-30 01:03:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:39,331 INFO L93 Difference]: Finished difference Result 5762 states and 23320 transitions. [2020-11-30 01:03:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:03:39,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-30 01:03:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:39,441 INFO L225 Difference]: With dead ends: 5762 [2020-11-30 01:03:39,441 INFO L226 Difference]: Without dead ends: 4862 [2020-11-30 01:03:39,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:03:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-11-30 01:03:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2020-11-30 01:03:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4862 states. [2020-11-30 01:03:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2020-11-30 01:03:39,839 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 3 [2020-11-30 01:03:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:39,840 INFO L481 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2020-11-30 01:03:39,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:03:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2020-11-30 01:03:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 01:03:39,853 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:39,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:39,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:03:39,854 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 356779252, now seen corresponding path program 1 times [2020-11-30 01:03:39,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:39,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263874843] [2020-11-30 01:03:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:40,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263874843] [2020-11-30 01:03:40,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:40,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:03:40,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477840365] [2020-11-30 01:03:40,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:03:40,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:03:40,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:03:40,055 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand 4 states. [2020-11-30 01:03:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:40,260 INFO L93 Difference]: Finished difference Result 5162 states and 20060 transitions. [2020-11-30 01:03:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:03:40,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-30 01:03:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:40,314 INFO L225 Difference]: With dead ends: 5162 [2020-11-30 01:03:40,315 INFO L226 Difference]: Without dead ends: 4262 [2020-11-30 01:03:40,315 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-11-30 01:03:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2020-11-30 01:03:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2020-11-30 01:03:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4262 states. [2020-11-30 01:03:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 16820 transitions. [2020-11-30 01:03:40,542 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 16820 transitions. Word has length 12 [2020-11-30 01:03:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:40,543 INFO L481 AbstractCegarLoop]: Abstraction has 4262 states and 16820 transitions. [2020-11-30 01:03:40,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:03:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 16820 transitions. [2020-11-30 01:03:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:03:40,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:40,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:40,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:03:40,548 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 691995836, now seen corresponding path program 1 times [2020-11-30 01:03:40,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:40,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684253190] [2020-11-30 01:03:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:40,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684253190] [2020-11-30 01:03:40,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:40,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:03:40,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259326574] [2020-11-30 01:03:40,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:03:40,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:03:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:03:40,748 INFO L87 Difference]: Start difference. First operand 4262 states and 16820 transitions. Second operand 5 states. [2020-11-30 01:03:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:40,969 INFO L93 Difference]: Finished difference Result 4462 states and 17190 transitions. [2020-11-30 01:03:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:03:40,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 01:03:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:41,035 INFO L225 Difference]: With dead ends: 4462 [2020-11-30 01:03:41,035 INFO L226 Difference]: Without dead ends: 3862 [2020-11-30 01:03:41,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:03:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2020-11-30 01:03:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3862. [2020-11-30 01:03:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2020-11-30 01:03:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 15080 transitions. [2020-11-30 01:03:41,219 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 15080 transitions. Word has length 14 [2020-11-30 01:03:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:41,220 INFO L481 AbstractCegarLoop]: Abstraction has 3862 states and 15080 transitions. [2020-11-30 01:03:41,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:03:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 15080 transitions. [2020-11-30 01:03:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 01:03:41,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:41,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:41,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:03:41,228 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1815490438, now seen corresponding path program 1 times [2020-11-30 01:03:41,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:41,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958837328] [2020-11-30 01:03:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:41,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958837328] [2020-11-30 01:03:41,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:41,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:03:41,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409543070] [2020-11-30 01:03:41,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:03:41,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:03:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:03:41,424 INFO L87 Difference]: Start difference. First operand 3862 states and 15080 transitions. Second operand 4 states. [2020-11-30 01:03:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:41,564 INFO L93 Difference]: Finished difference Result 3674 states and 12980 transitions. [2020-11-30 01:03:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:03:41,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-30 01:03:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:41,582 INFO L225 Difference]: With dead ends: 3674 [2020-11-30 01:03:41,582 INFO L226 Difference]: Without dead ends: 2774 [2020-11-30 01:03:41,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:03:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2020-11-30 01:03:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774. [2020-11-30 01:03:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2020-11-30 01:03:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 9640 transitions. [2020-11-30 01:03:41,717 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 9640 transitions. Word has length 16 [2020-11-30 01:03:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:41,718 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 9640 transitions. [2020-11-30 01:03:41,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:03:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 9640 transitions. [2020-11-30 01:03:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 01:03:41,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:41,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:41,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:03:41,727 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1327426805, now seen corresponding path program 1 times [2020-11-30 01:03:41,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:41,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140684317] [2020-11-30 01:03:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:41,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140684317] [2020-11-30 01:03:41,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:41,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:03:41,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679826196] [2020-11-30 01:03:41,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:03:41,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:03:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:03:41,942 INFO L87 Difference]: Start difference. First operand 2774 states and 9640 transitions. Second operand 5 states. [2020-11-30 01:03:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:42,032 INFO L93 Difference]: Finished difference Result 2218 states and 7116 transitions. [2020-11-30 01:03:42,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:03:42,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-30 01:03:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:42,042 INFO L225 Difference]: With dead ends: 2218 [2020-11-30 01:03:42,042 INFO L226 Difference]: Without dead ends: 1718 [2020-11-30 01:03:42,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:03:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-11-30 01:03:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2020-11-30 01:03:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2020-11-30 01:03:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 5416 transitions. [2020-11-30 01:03:42,123 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 5416 transitions. Word has length 19 [2020-11-30 01:03:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:42,124 INFO L481 AbstractCegarLoop]: Abstraction has 1718 states and 5416 transitions. [2020-11-30 01:03:42,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:03:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 5416 transitions. [2020-11-30 01:03:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:03:42,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:42,134 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] [2020-11-30 01:03:42,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:03:42,135 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1700551744, now seen corresponding path program 1 times [2020-11-30 01:03:42,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:42,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293863592] [2020-11-30 01:03:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:42,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293863592] [2020-11-30 01:03:42,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:42,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:03:42,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969118369] [2020-11-30 01:03:42,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:03:42,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:03:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:03:42,408 INFO L87 Difference]: Start difference. First operand 1718 states and 5416 transitions. Second operand 6 states. [2020-11-30 01:03:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:42,529 INFO L93 Difference]: Finished difference Result 1470 states and 4633 transitions. [2020-11-30 01:03:42,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:03:42,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-30 01:03:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:42,538 INFO L225 Difference]: With dead ends: 1470 [2020-11-30 01:03:42,538 INFO L226 Difference]: Without dead ends: 1330 [2020-11-30 01:03:42,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:03:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2020-11-30 01:03:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2020-11-30 01:03:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-11-30 01:03:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 4252 transitions. [2020-11-30 01:03:42,594 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 4252 transitions. Word has length 22 [2020-11-30 01:03:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:42,595 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 4252 transitions. [2020-11-30 01:03:42,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:03:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 4252 transitions. [2020-11-30 01:03:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:03:42,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:42,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:42,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:03:42,602 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1722797549, now seen corresponding path program 1 times [2020-11-30 01:03:42,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:42,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170927486] [2020-11-30 01:03:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:42,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170927486] [2020-11-30 01:03:42,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:42,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:03:42,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644238454] [2020-11-30 01:03:42,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:03:42,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:03:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:03:42,899 INFO L87 Difference]: Start difference. First operand 1330 states and 4252 transitions. Second operand 8 states. [2020-11-30 01:03:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:43,385 INFO L93 Difference]: Finished difference Result 2056 states and 6269 transitions. [2020-11-30 01:03:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:03:43,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-11-30 01:03:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:43,394 INFO L225 Difference]: With dead ends: 2056 [2020-11-30 01:03:43,394 INFO L226 Difference]: Without dead ends: 1757 [2020-11-30 01:03:43,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:03:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2020-11-30 01:03:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1589. [2020-11-30 01:03:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-11-30 01:03:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 4976 transitions. [2020-11-30 01:03:43,470 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 4976 transitions. Word has length 26 [2020-11-30 01:03:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:43,470 INFO L481 AbstractCegarLoop]: Abstraction has 1589 states and 4976 transitions. [2020-11-30 01:03:43,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:03:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 4976 transitions. [2020-11-30 01:03:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:03:43,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:43,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:43,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:03:43,477 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash -76560941, now seen corresponding path program 2 times [2020-11-30 01:03:43,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:43,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794364792] [2020-11-30 01:03:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:43,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794364792] [2020-11-30 01:03:43,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:43,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:03:43,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028967995] [2020-11-30 01:03:43,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:03:43,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:03:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:03:43,702 INFO L87 Difference]: Start difference. First operand 1589 states and 4976 transitions. Second operand 7 states. [2020-11-30 01:03:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:43,827 INFO L93 Difference]: Finished difference Result 1544 states and 4881 transitions. [2020-11-30 01:03:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:03:43,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-11-30 01:03:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:43,834 INFO L225 Difference]: With dead ends: 1544 [2020-11-30 01:03:43,834 INFO L226 Difference]: Without dead ends: 1394 [2020-11-30 01:03:43,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:03:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-11-30 01:03:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2020-11-30 01:03:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-11-30 01:03:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 4444 transitions. [2020-11-30 01:03:43,889 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 4444 transitions. Word has length 26 [2020-11-30 01:03:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:43,891 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 4444 transitions. [2020-11-30 01:03:43,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:03:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 4444 transitions. [2020-11-30 01:03:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:03:43,897 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:43,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:43,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:03:43,898 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:43,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:43,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1902767598, now seen corresponding path program 1 times [2020-11-30 01:03:43,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:43,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999496838] [2020-11-30 01:03:43,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:44,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999496838] [2020-11-30 01:03:44,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:44,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:03:44,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310818762] [2020-11-30 01:03:44,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:03:44,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:03:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:03:44,507 INFO L87 Difference]: Start difference. First operand 1394 states and 4444 transitions. Second operand 14 states. [2020-11-30 01:03:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:45,840 INFO L93 Difference]: Finished difference Result 1679 states and 5097 transitions. [2020-11-30 01:03:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 01:03:45,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2020-11-30 01:03:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:45,845 INFO L225 Difference]: With dead ends: 1679 [2020-11-30 01:03:45,845 INFO L226 Difference]: Without dead ends: 1469 [2020-11-30 01:03:45,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2020-11-30 01:03:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-11-30 01:03:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1355. [2020-11-30 01:03:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2020-11-30 01:03:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 4215 transitions. [2020-11-30 01:03:45,894 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 4215 transitions. Word has length 30 [2020-11-30 01:03:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:45,895 INFO L481 AbstractCegarLoop]: Abstraction has 1355 states and 4215 transitions. [2020-11-30 01:03:45,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:03:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 4215 transitions. [2020-11-30 01:03:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:03:45,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:45,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:45,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:03:45,901 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2114921304, now seen corresponding path program 2 times [2020-11-30 01:03:45,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:45,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444937410] [2020-11-30 01:03:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:46,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444937410] [2020-11-30 01:03:46,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:46,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:03:46,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617447403] [2020-11-30 01:03:46,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:03:46,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:03:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:03:46,391 INFO L87 Difference]: Start difference. First operand 1355 states and 4215 transitions. Second operand 9 states. [2020-11-30 01:03:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:46,715 INFO L93 Difference]: Finished difference Result 1785 states and 5393 transitions. [2020-11-30 01:03:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:03:46,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-11-30 01:03:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:46,722 INFO L225 Difference]: With dead ends: 1785 [2020-11-30 01:03:46,722 INFO L226 Difference]: Without dead ends: 1539 [2020-11-30 01:03:46,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:03:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2020-11-30 01:03:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1279. [2020-11-30 01:03:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-11-30 01:03:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 3939 transitions. [2020-11-30 01:03:46,771 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 3939 transitions. Word has length 30 [2020-11-30 01:03:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:46,771 INFO L481 AbstractCegarLoop]: Abstraction has 1279 states and 3939 transitions. [2020-11-30 01:03:46,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:03:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 3939 transitions. [2020-11-30 01:03:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:03:46,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:46,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:46,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:03:46,777 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash -571098194, now seen corresponding path program 3 times [2020-11-30 01:03:46,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:46,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974736434] [2020-11-30 01:03:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:47,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974736434] [2020-11-30 01:03:47,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:03:47,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:03:47,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8925718] [2020-11-30 01:03:47,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:03:47,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:03:47,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:03:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:03:47,064 INFO L87 Difference]: Start difference. First operand 1279 states and 3939 transitions. Second operand 9 states. [2020-11-30 01:03:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:03:47,449 INFO L93 Difference]: Finished difference Result 1799 states and 5415 transitions. [2020-11-30 01:03:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:03:47,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-11-30 01:03:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:03:47,456 INFO L225 Difference]: With dead ends: 1799 [2020-11-30 01:03:47,457 INFO L226 Difference]: Without dead ends: 1720 [2020-11-30 01:03:47,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:03:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2020-11-30 01:03:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1279. [2020-11-30 01:03:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-11-30 01:03:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 3931 transitions. [2020-11-30 01:03:47,508 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 3931 transitions. Word has length 30 [2020-11-30 01:03:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:03:47,510 INFO L481 AbstractCegarLoop]: Abstraction has 1279 states and 3931 transitions. [2020-11-30 01:03:47,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:03:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 3931 transitions. [2020-11-30 01:03:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:03:47,516 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:03:47,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:03:47,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:03:47,517 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:03:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:03:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1011467502, now seen corresponding path program 4 times [2020-11-30 01:03:47,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:03:47,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765822546] [2020-11-30 01:03:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:03:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:03:47,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:03:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:03:47,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:03:47,813 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:03:47,813 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:03:47,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:03:47,858 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,858 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,859 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [755] [2020-11-30 01:03:47,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,872 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,872 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,873 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,881 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,881 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:47,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:47,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:03:48 BasicIcfg [2020-11-30 01:03:48,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:03:48,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:03:48,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:03:48,018 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:03:48,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:03:29" (3/4) ... [2020-11-30 01:03:48,020 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:03:48,050 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,051 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,051 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [755] [2020-11-30 01:03:48,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,057 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,057 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,057 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,058 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,058 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,058 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,058 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 01:03:48,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 01:03:48,209 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6ae301e5-002e-472c-95a5-f4a317baaa75/bin/uautomizer/witness.graphml [2020-11-30 01:03:48,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:03:48,211 INFO L168 Benchmark]: Toolchain (without parser) took 22959.90 ms. Allocated memory was 86.0 MB in the beginning and 379.6 MB in the end (delta: 293.6 MB). Free memory was 52.1 MB in the beginning and 145.2 MB in the end (delta: -93.2 MB). Peak memory consumption was 201.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:03:48,211 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 86.0 MB. Free memory was 58.7 MB in the beginning and 58.6 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:03:48,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.30 ms. Allocated memory is still 86.0 MB. Free memory was 51.8 MB in the beginning and 38.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:03:48,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.89 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 38.4 MB in the beginning and 82.0 MB in the end (delta: -43.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:03:48,212 INFO L168 Benchmark]: Boogie Preprocessor took 85.56 ms. Allocated memory is still 104.9 MB. Free memory was 82.0 MB in the beginning and 79.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:03:48,212 INFO L168 Benchmark]: RCFGBuilder took 3629.51 ms. Allocated memory was 104.9 MB in the beginning and 132.1 MB in the end (delta: 27.3 MB). Free memory was 79.9 MB in the beginning and 75.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:03:48,213 INFO L168 Benchmark]: TraceAbstraction took 18091.24 ms. Allocated memory was 132.1 MB in the beginning and 379.6 MB in the end (delta: 247.5 MB). Free memory was 75.8 MB in the beginning and 176.7 MB in the end (delta: -100.9 MB). Peak memory consumption was 147.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:03:48,213 INFO L168 Benchmark]: Witness Printer took 192.15 ms. Allocated memory is still 379.6 MB. Free memory was 176.7 MB in the beginning and 145.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:03:48,216 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.34 ms. Allocated memory is still 86.0 MB. Free memory was 58.7 MB in the beginning and 58.6 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 856.30 ms. Allocated memory is still 86.0 MB. Free memory was 51.8 MB in the beginning and 38.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.89 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 38.4 MB in the beginning and 82.0 MB in the end (delta: -43.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.56 ms. Allocated memory is still 104.9 MB. Free memory was 82.0 MB in the beginning and 79.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3629.51 ms. Allocated memory was 104.9 MB in the beginning and 132.1 MB in the end (delta: 27.3 MB). Free memory was 79.9 MB in the beginning and 75.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18091.24 ms. Allocated memory was 132.1 MB in the beginning and 379.6 MB in the end (delta: 247.5 MB). Free memory was 75.8 MB in the beginning and 176.7 MB in the end (delta: -100.9 MB). Peak memory consumption was 147.6 MB. Max. memory is 16.1 GB. * Witness Printer took 192.15 ms. Allocated memory is still 379.6 MB. Free memory was 176.7 MB in the beginning and 145.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2024 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 69 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 244 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.9s, 135 PlacesBefore, 49 PlacesAfterwards, 125 TransitionsBefore, 37 TransitionsAfterwards, 3134 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 10098 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix004_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L877] 0 pthread_t t91; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L878] FCALL, FORK 0 pthread_create(&t91, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t92; [L809] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1 [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=1] [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix004_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 123 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 554 SDtfs, 820 SDslu, 2264 SDs, 0 SdLazy, 1272 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6914occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 983 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 53745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...