./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_pso.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_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/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 008fb579454997f18a444345985f299986cf8c60 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:20:23,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:20:23,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:20:23,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:20:23,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:20:23,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:20:23,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:20:23,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:20:23,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:20:23,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:20:23,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:20:23,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:20:23,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:20:23,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:20:23,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:20:23,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:20:23,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:20:23,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:20:23,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:20:23,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:20:23,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:20:23,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:20:23,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:20:23,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:20:23,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:20:23,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:20:23,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:20:23,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:20:23,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:20:23,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:20:23,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:20:23,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:20:23,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:20:23,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:20:23,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:20:23,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:20:23,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:20:23,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:20:23,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:20:23,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:20:23,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:20:23,327 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 20:20:23,349 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:20:23,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:20:23,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:20:23,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:20:23,351 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:20:23,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:20:23,352 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:20:23,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:20:23,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:20:23,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:20:23,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 20:20:23,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:20:23,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 20:20:23,353 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:20:23,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:20:23,354 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:20:23,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 20:20:23,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:20:23,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:20:23,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:20:23,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:20:23,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:20:23,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:20:23,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:20:23,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 20:20:23,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:20:23,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:20:23,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 20:20:23,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:20:23,357 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_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/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_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/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 -> 008fb579454997f18a444345985f299986cf8c60 [2020-11-29 20:20:23,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:20:23,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:20:23,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:20:23,664 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:20:23,667 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:20:23,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe017_pso.oepc.i [2020-11-29 20:20:23,763 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/data/ddff51d0d/a659e19447cd4f478513d0a89639fe66/FLAG77392ceb0 [2020-11-29 20:20:24,340 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:20:24,340 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/sv-benchmarks/c/pthread-wmm/safe017_pso.oepc.i [2020-11-29 20:20:24,360 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/data/ddff51d0d/a659e19447cd4f478513d0a89639fe66/FLAG77392ceb0 [2020-11-29 20:20:24,609 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/data/ddff51d0d/a659e19447cd4f478513d0a89639fe66 [2020-11-29 20:20:24,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:20:24,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:20:24,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:20:24,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:20:24,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:20:24,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:20:24" (1/1) ... [2020-11-29 20:20:24,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316d4ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:24, skipping insertion in model container [2020-11-29 20:20:24,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:20:24" (1/1) ... [2020-11-29 20:20:24,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:20:24,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:20:25,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:20:25,191 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:20:25,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:20:25,381 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:20:25,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25 WrapperNode [2020-11-29 20:20:25,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:20:25,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:20:25,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:20:25,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:20:25,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:20:25,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:20:25,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:20:25,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:20:25,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... [2020-11-29 20:20:25,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:20:25,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:20:25,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:20:25,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:20:25,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:20:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 20:20:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 20:20:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:20:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 20:20:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 20:20:25,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 20:20:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 20:20:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 20:20:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 20:20:25,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 20:20:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:20:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 20:20:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:20:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:20:25,625 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-29 20:20:28,388 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:20:28,388 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 20:20:28,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:20:28 BoogieIcfgContainer [2020-11-29 20:20:28,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:20:28,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:20:28,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:20:28,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:20:28,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:20:24" (1/3) ... [2020-11-29 20:20:28,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de8acff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:20:28, skipping insertion in model container [2020-11-29 20:20:28,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:20:25" (2/3) ... [2020-11-29 20:20:28,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de8acff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:20:28, skipping insertion in model container [2020-11-29 20:20:28,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:20:28" (3/3) ... [2020-11-29 20:20:28,398 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2020-11-29 20:20:28,409 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 20:20:28,409 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:20:28,413 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 20:20:28,414 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 20:20:28,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,451 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,456 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,456 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:20:28,472 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 20:20:28,483 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-29 20:20:28,513 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:20:28,513 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 20:20:28,513 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:20:28,514 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:20:28,514 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:20:28,514 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:20:28,515 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:20:28,515 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:20:28,531 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 20:20:28,533 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-29 20:20:28,536 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-29 20:20:28,538 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-11-29 20:20:28,586 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-11-29 20:20:28,586 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 20:20:28,590 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-29 20:20:28,593 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-11-29 20:20:28,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:28,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:28,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:28,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:28,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:28,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:20:28,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:28,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:29,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:29,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:29,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:29,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:29,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:29,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:29,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:29,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:29,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:29,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:29,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:20:29,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:29,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,686 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-29 20:20:29,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:29,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:29,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:20:29,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:29,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:29,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:29,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:29,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:29,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:29,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:29,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:30,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:30,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-29 20:20:30,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:30,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:30,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:30,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:30,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:20:30,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:30,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:30,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:30,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:30,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:30,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:20:30,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:30,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:30,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:20:30,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:30,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:30,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:30,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:20:30,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:30,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:20:30,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-29 20:20:31,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 20:20:31,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 20:20:31,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:31,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:31,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-29 20:20:31,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:31,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:20:31,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:31,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:31,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:32,422 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-29 20:20:32,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-29 20:20:32,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:32,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-29 20:20:32,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:33,347 WARN L193 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2020-11-29 20:20:33,717 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-29 20:20:33,877 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 20:20:34,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-29 20:20:34,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:34,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:34,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-29 20:20:34,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:34,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-29 20:20:34,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-29 20:20:34,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:34,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-29 20:20:34,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:34,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:34,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:34,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:34,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:34,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:34,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-29 20:20:34,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-29 20:20:34,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:34,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:34,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:34,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:34,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:34,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:34,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:34,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:34,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:34,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:34,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:34,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:35,287 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-29 20:20:35,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:35,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:35,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:35,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:35,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:35,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:35,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:35,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:35,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:35,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:35,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:35,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:35,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:35,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:35,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:35,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:35,980 WARN L193 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-29 20:20:36,208 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-29 20:20:36,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 3, 6, 3, 2, 1] term [2020-11-29 20:20:36,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:36,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 3, 6, 3, 2, 1] term [2020-11-29 20:20:36,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:36,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 2, 2, 1] term [2020-11-29 20:20:36,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:36,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 3, 2, 1] term [2020-11-29 20:20:36,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:36,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:36,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:36,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:36,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:36,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:36,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:36,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:36,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:36,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 6, 3, 6, 3, 2, 1] term [2020-11-29 20:20:36,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:36,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:36,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:36,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:36,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:36,441 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-29 20:20:36,559 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-29 20:20:37,338 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-29 20:20:37,747 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-29 20:20:37,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:37,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:37,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:37,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:37,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:37,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:37,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:37,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:37,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:37,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:37,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:37,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:37,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:37,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:37,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:37,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:37,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:37,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:37,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:37,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:37,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:37,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,254 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-29 20:20:38,407 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-29 20:20:38,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:38,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:20:38,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:38,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:38,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:20:38,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-11-29 20:20:38,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:20:38,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:20:38,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:20:38,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:20:38,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:20:38,914 INFO L131 LiptonReduction]: Checked pairs total: 4794 [2020-11-29 20:20:38,915 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-29 20:20:38,920 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-29 20:20:38,973 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-11-29 20:20:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-11-29 20:20:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-29 20:20:38,981 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:38,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-29 20:20:38,984 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times [2020-11-29 20:20:39,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:39,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25861351] [2020-11-29 20:20:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:39,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25861351] [2020-11-29 20:20:39,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:39,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 20:20:39,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563609968] [2020-11-29 20:20:39,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:20:39,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:39,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:20:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:20:39,281 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-11-29 20:20:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:39,392 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-11-29 20:20:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:20:39,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-29 20:20:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:39,423 INFO L225 Difference]: With dead ends: 552 [2020-11-29 20:20:39,423 INFO L226 Difference]: Without dead ends: 452 [2020-11-29 20:20:39,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:20:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-29 20:20:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-11-29 20:20:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-11-29 20:20:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-11-29 20:20:39,510 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-11-29 20:20:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:39,510 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-11-29 20:20:39,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:20:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-11-29 20:20:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 20:20:39,512 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:39,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:39,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:20:39,513 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:39,513 INFO L82 PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times [2020-11-29 20:20:39,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:39,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131339358] [2020-11-29 20:20:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:39,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131339358] [2020-11-29 20:20:39,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:39,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 20:20:39,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295540970] [2020-11-29 20:20:39,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:20:39,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:20:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:20:39,618 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-11-29 20:20:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:39,634 INFO L93 Difference]: Finished difference Result 432 states and 1291 transitions. [2020-11-29 20:20:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:20:39,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-29 20:20:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:39,639 INFO L225 Difference]: With dead ends: 432 [2020-11-29 20:20:39,639 INFO L226 Difference]: Without dead ends: 432 [2020-11-29 20:20:39,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:20:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-29 20:20:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-11-29 20:20:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-11-29 20:20:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1291 transitions. [2020-11-29 20:20:39,664 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1291 transitions. Word has length 9 [2020-11-29 20:20:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:39,665 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1291 transitions. [2020-11-29 20:20:39,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:20:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1291 transitions. [2020-11-29 20:20:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 20:20:39,667 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:39,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:39,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:20:39,668 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash 450921755, now seen corresponding path program 1 times [2020-11-29 20:20:39,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:39,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603049670] [2020-11-29 20:20:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:39,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603049670] [2020-11-29 20:20:39,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:39,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:20:39,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404925580] [2020-11-29 20:20:39,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:20:39,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:39,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:20:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:20:39,841 INFO L87 Difference]: Start difference. First operand 432 states and 1291 transitions. Second operand 4 states. [2020-11-29 20:20:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:39,894 INFO L93 Difference]: Finished difference Result 640 states and 1891 transitions. [2020-11-29 20:20:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:20:39,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-29 20:20:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:39,899 INFO L225 Difference]: With dead ends: 640 [2020-11-29 20:20:39,899 INFO L226 Difference]: Without dead ends: 400 [2020-11-29 20:20:39,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-11-29 20:20:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-11-29 20:20:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-11-29 20:20:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1173 transitions. [2020-11-29 20:20:39,917 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1173 transitions. Word has length 10 [2020-11-29 20:20:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:39,917 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1173 transitions. [2020-11-29 20:20:39,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:20:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1173 transitions. [2020-11-29 20:20:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 20:20:39,919 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:39,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:39,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:20:39,920 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 308607583, now seen corresponding path program 1 times [2020-11-29 20:20:39,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:39,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850583778] [2020-11-29 20:20:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:40,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850583778] [2020-11-29 20:20:40,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:40,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:20:40,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482424247] [2020-11-29 20:20:40,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:20:40,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:20:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:20:40,095 INFO L87 Difference]: Start difference. First operand 400 states and 1173 transitions. Second operand 4 states. [2020-11-29 20:20:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:40,151 INFO L93 Difference]: Finished difference Result 399 states and 1169 transitions. [2020-11-29 20:20:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:20:40,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 20:20:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:40,157 INFO L225 Difference]: With dead ends: 399 [2020-11-29 20:20:40,157 INFO L226 Difference]: Without dead ends: 399 [2020-11-29 20:20:40,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:20:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2020-11-29 20:20:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2020-11-29 20:20:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-11-29 20:20:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1169 transitions. [2020-11-29 20:20:40,173 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1169 transitions. Word has length 11 [2020-11-29 20:20:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:40,173 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 1169 transitions. [2020-11-29 20:20:40,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:20:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1169 transitions. [2020-11-29 20:20:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 20:20:40,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:40,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:40,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:20:40,177 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash 313291130, now seen corresponding path program 1 times [2020-11-29 20:20:40,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:40,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655039272] [2020-11-29 20:20:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:40,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655039272] [2020-11-29 20:20:40,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:40,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:20:40,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499545937] [2020-11-29 20:20:40,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:20:40,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:40,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:20:40,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:40,317 INFO L87 Difference]: Start difference. First operand 399 states and 1169 transitions. Second operand 5 states. [2020-11-29 20:20:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:40,378 INFO L93 Difference]: Finished difference Result 396 states and 1157 transitions. [2020-11-29 20:20:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:20:40,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-29 20:20:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:40,382 INFO L225 Difference]: With dead ends: 396 [2020-11-29 20:20:40,382 INFO L226 Difference]: Without dead ends: 396 [2020-11-29 20:20:40,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2020-11-29 20:20:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2020-11-29 20:20:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-11-29 20:20:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1157 transitions. [2020-11-29 20:20:40,397 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1157 transitions. Word has length 12 [2020-11-29 20:20:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:40,397 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 1157 transitions. [2020-11-29 20:20:40,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:20:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1157 transitions. [2020-11-29 20:20:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 20:20:40,398 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:40,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:40,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 20:20:40,399 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1233675543, now seen corresponding path program 1 times [2020-11-29 20:20:40,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:40,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134127739] [2020-11-29 20:20:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:40,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134127739] [2020-11-29 20:20:40,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:40,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:20:40,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148469766] [2020-11-29 20:20:40,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:20:40,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:20:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:40,670 INFO L87 Difference]: Start difference. First operand 396 states and 1157 transitions. Second operand 5 states. [2020-11-29 20:20:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:40,747 INFO L93 Difference]: Finished difference Result 394 states and 1150 transitions. [2020-11-29 20:20:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:20:40,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-29 20:20:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:40,751 INFO L225 Difference]: With dead ends: 394 [2020-11-29 20:20:40,751 INFO L226 Difference]: Without dead ends: 394 [2020-11-29 20:20:40,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-11-29 20:20:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2020-11-29 20:20:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-11-29 20:20:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1150 transitions. [2020-11-29 20:20:40,765 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1150 transitions. Word has length 12 [2020-11-29 20:20:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:40,766 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 1150 transitions. [2020-11-29 20:20:40,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:20:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1150 transitions. [2020-11-29 20:20:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 20:20:40,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:40,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:40,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 20:20:40,770 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times [2020-11-29 20:20:40,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:40,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068160351] [2020-11-29 20:20:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:40,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068160351] [2020-11-29 20:20:40,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:40,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:20:40,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136045829] [2020-11-29 20:20:40,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:20:40,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:20:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:40,859 INFO L87 Difference]: Start difference. First operand 394 states and 1150 transitions. Second operand 5 states. [2020-11-29 20:20:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:40,940 INFO L93 Difference]: Finished difference Result 392 states and 1142 transitions. [2020-11-29 20:20:40,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:20:40,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-29 20:20:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:40,947 INFO L225 Difference]: With dead ends: 392 [2020-11-29 20:20:40,947 INFO L226 Difference]: Without dead ends: 392 [2020-11-29 20:20:40,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-11-29 20:20:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 385. [2020-11-29 20:20:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-29 20:20:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1120 transitions. [2020-11-29 20:20:40,961 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1120 transitions. Word has length 12 [2020-11-29 20:20:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:40,962 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 1120 transitions. [2020-11-29 20:20:40,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:20:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1120 transitions. [2020-11-29 20:20:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 20:20:40,963 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:40,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:40,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 20:20:40,964 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times [2020-11-29 20:20:40,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:40,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196085312] [2020-11-29 20:20:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:41,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196085312] [2020-11-29 20:20:41,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:41,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:20:41,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154270970] [2020-11-29 20:20:41,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:20:41,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:20:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:20:41,132 INFO L87 Difference]: Start difference. First operand 385 states and 1120 transitions. Second operand 6 states. [2020-11-29 20:20:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:41,259 INFO L93 Difference]: Finished difference Result 381 states and 1106 transitions. [2020-11-29 20:20:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:20:41,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-29 20:20:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:41,266 INFO L225 Difference]: With dead ends: 381 [2020-11-29 20:20:41,266 INFO L226 Difference]: Without dead ends: 381 [2020-11-29 20:20:41,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:20:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-11-29 20:20:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2020-11-29 20:20:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-11-29 20:20:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1106 transitions. [2020-11-29 20:20:41,280 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1106 transitions. Word has length 13 [2020-11-29 20:20:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:41,280 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 1106 transitions. [2020-11-29 20:20:41,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:20:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1106 transitions. [2020-11-29 20:20:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 20:20:41,281 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:41,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:41,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 20:20:41,282 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1122009596, now seen corresponding path program 1 times [2020-11-29 20:20:41,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:41,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176672508] [2020-11-29 20:20:41,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:41,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176672508] [2020-11-29 20:20:41,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:41,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:20:41,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453548608] [2020-11-29 20:20:41,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:20:41,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:20:41,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:20:41,375 INFO L87 Difference]: Start difference. First operand 381 states and 1106 transitions. Second operand 6 states. [2020-11-29 20:20:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:41,490 INFO L93 Difference]: Finished difference Result 428 states and 1239 transitions. [2020-11-29 20:20:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:20:41,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-29 20:20:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:41,495 INFO L225 Difference]: With dead ends: 428 [2020-11-29 20:20:41,495 INFO L226 Difference]: Without dead ends: 428 [2020-11-29 20:20:41,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:20:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-11-29 20:20:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2020-11-29 20:20:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-11-29 20:20:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1221 transitions. [2020-11-29 20:20:41,512 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1221 transitions. Word has length 13 [2020-11-29 20:20:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:41,512 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1221 transitions. [2020-11-29 20:20:41,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:20:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1221 transitions. [2020-11-29 20:20:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 20:20:41,514 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:41,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:41,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 20:20:41,514 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash -337816853, now seen corresponding path program 1 times [2020-11-29 20:20:41,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:41,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823900635] [2020-11-29 20:20:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:41,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823900635] [2020-11-29 20:20:41,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:41,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:20:41,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497801758] [2020-11-29 20:20:41,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:20:41,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:20:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:20:41,594 INFO L87 Difference]: Start difference. First operand 420 states and 1221 transitions. Second operand 4 states. [2020-11-29 20:20:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:41,630 INFO L93 Difference]: Finished difference Result 875 states and 2458 transitions. [2020-11-29 20:20:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:20:41,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-29 20:20:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:41,634 INFO L225 Difference]: With dead ends: 875 [2020-11-29 20:20:41,634 INFO L226 Difference]: Without dead ends: 392 [2020-11-29 20:20:41,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-11-29 20:20:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 368. [2020-11-29 20:20:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-11-29 20:20:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 992 transitions. [2020-11-29 20:20:41,648 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 992 transitions. Word has length 13 [2020-11-29 20:20:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:41,648 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 992 transitions. [2020-11-29 20:20:41,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:20:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 992 transitions. [2020-11-29 20:20:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 20:20:41,649 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:41,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:41,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 20:20:41,650 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times [2020-11-29 20:20:41,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:41,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785945672] [2020-11-29 20:20:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:41,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785945672] [2020-11-29 20:20:41,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:41,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:20:41,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959089823] [2020-11-29 20:20:41,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:20:41,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:41,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:20:41,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:20:41,895 INFO L87 Difference]: Start difference. First operand 368 states and 992 transitions. Second operand 7 states. [2020-11-29 20:20:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:42,061 INFO L93 Difference]: Finished difference Result 400 states and 1056 transitions. [2020-11-29 20:20:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:20:42,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-29 20:20:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:42,065 INFO L225 Difference]: With dead ends: 400 [2020-11-29 20:20:42,065 INFO L226 Difference]: Without dead ends: 364 [2020-11-29 20:20:42,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:20:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-11-29 20:20:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 328. [2020-11-29 20:20:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-11-29 20:20:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 867 transitions. [2020-11-29 20:20:42,077 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 867 transitions. Word has length 14 [2020-11-29 20:20:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:42,077 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 867 transitions. [2020-11-29 20:20:42,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:20:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 867 transitions. [2020-11-29 20:20:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 20:20:42,078 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:42,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:42,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 20:20:42,079 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times [2020-11-29 20:20:42,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:42,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242991600] [2020-11-29 20:20:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:42,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242991600] [2020-11-29 20:20:42,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:42,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:20:42,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967638644] [2020-11-29 20:20:42,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:20:42,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:20:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:20:42,358 INFO L87 Difference]: Start difference. First operand 328 states and 867 transitions. Second operand 7 states. [2020-11-29 20:20:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:42,521 INFO L93 Difference]: Finished difference Result 432 states and 1099 transitions. [2020-11-29 20:20:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:20:42,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-29 20:20:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:42,533 INFO L225 Difference]: With dead ends: 432 [2020-11-29 20:20:42,533 INFO L226 Difference]: Without dead ends: 340 [2020-11-29 20:20:42,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:20:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-11-29 20:20:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 322. [2020-11-29 20:20:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-11-29 20:20:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 828 transitions. [2020-11-29 20:20:42,547 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 828 transitions. Word has length 14 [2020-11-29 20:20:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:42,548 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 828 transitions. [2020-11-29 20:20:42,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:20:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 828 transitions. [2020-11-29 20:20:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 20:20:42,549 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:42,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:42,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 20:20:42,549 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:42,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 1 times [2020-11-29 20:20:42,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:42,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738837070] [2020-11-29 20:20:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:42,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738837070] [2020-11-29 20:20:42,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:42,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:20:42,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424876101] [2020-11-29 20:20:42,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:20:42,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:20:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:20:42,644 INFO L87 Difference]: Start difference. First operand 322 states and 828 transitions. Second operand 4 states. [2020-11-29 20:20:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:42,678 INFO L93 Difference]: Finished difference Result 326 states and 743 transitions. [2020-11-29 20:20:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:20:42,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-29 20:20:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:42,681 INFO L225 Difference]: With dead ends: 326 [2020-11-29 20:20:42,681 INFO L226 Difference]: Without dead ends: 244 [2020-11-29 20:20:42,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-11-29 20:20:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2020-11-29 20:20:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-11-29 20:20:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 550 transitions. [2020-11-29 20:20:42,689 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 550 transitions. Word has length 14 [2020-11-29 20:20:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:42,689 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 550 transitions. [2020-11-29 20:20:42,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:20:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 550 transitions. [2020-11-29 20:20:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 20:20:42,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:42,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:42,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 20:20:42,691 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1637663200, now seen corresponding path program 1 times [2020-11-29 20:20:42,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:42,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388028822] [2020-11-29 20:20:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:42,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388028822] [2020-11-29 20:20:42,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:42,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:20:42,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760200701] [2020-11-29 20:20:42,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:20:42,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:42,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:20:42,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:20:42,773 INFO L87 Difference]: Start difference. First operand 244 states and 550 transitions. Second operand 5 states. [2020-11-29 20:20:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:42,822 INFO L93 Difference]: Finished difference Result 208 states and 421 transitions. [2020-11-29 20:20:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:20:42,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-29 20:20:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:42,824 INFO L225 Difference]: With dead ends: 208 [2020-11-29 20:20:42,824 INFO L226 Difference]: Without dead ends: 161 [2020-11-29 20:20:42,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:20:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-29 20:20:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2020-11-29 20:20:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-11-29 20:20:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 317 transitions. [2020-11-29 20:20:42,829 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 317 transitions. Word has length 15 [2020-11-29 20:20:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:42,829 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 317 transitions. [2020-11-29 20:20:42,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:20:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 317 transitions. [2020-11-29 20:20:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 20:20:42,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:42,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:42,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 20:20:42,830 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times [2020-11-29 20:20:42,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:42,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481000496] [2020-11-29 20:20:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:43,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481000496] [2020-11-29 20:20:43,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:43,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:20:43,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699605417] [2020-11-29 20:20:43,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:20:43,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:43,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:20:43,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:20:43,174 INFO L87 Difference]: Start difference. First operand 161 states and 317 transitions. Second operand 7 states. [2020-11-29 20:20:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:43,415 INFO L93 Difference]: Finished difference Result 178 states and 341 transitions. [2020-11-29 20:20:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:20:43,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-29 20:20:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:43,417 INFO L225 Difference]: With dead ends: 178 [2020-11-29 20:20:43,418 INFO L226 Difference]: Without dead ends: 126 [2020-11-29 20:20:43,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:20:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-29 20:20:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2020-11-29 20:20:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-29 20:20:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 228 transitions. [2020-11-29 20:20:43,422 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 228 transitions. Word has length 17 [2020-11-29 20:20:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:43,422 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 228 transitions. [2020-11-29 20:20:43,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:20:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 228 transitions. [2020-11-29 20:20:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 20:20:43,423 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:43,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:43,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 20:20:43,424 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times [2020-11-29 20:20:43,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:43,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351038848] [2020-11-29 20:20:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:20:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:20:43,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351038848] [2020-11-29 20:20:43,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:20:43,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:20:43,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734993940] [2020-11-29 20:20:43,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:20:43,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:20:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:20:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:20:43,560 INFO L87 Difference]: Start difference. First operand 115 states and 228 transitions. Second operand 6 states. [2020-11-29 20:20:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:20:43,652 INFO L93 Difference]: Finished difference Result 102 states and 201 transitions. [2020-11-29 20:20:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:20:43,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-29 20:20:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:20:43,653 INFO L225 Difference]: With dead ends: 102 [2020-11-29 20:20:43,654 INFO L226 Difference]: Without dead ends: 59 [2020-11-29 20:20:43,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:20:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-29 20:20:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-29 20:20:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-29 20:20:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2020-11-29 20:20:43,656 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 17 [2020-11-29 20:20:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:20:43,657 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2020-11-29 20:20:43,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:20:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2020-11-29 20:20:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 20:20:43,657 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:20:43,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:20:43,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 20:20:43,658 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:20:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:20:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times [2020-11-29 20:20:43,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:20:43,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529979996] [2020-11-29 20:20:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:20:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:20:43,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:20:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:20:43,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:20:43,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:20:43,812 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 20:20:43,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 20:20:43,814 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-29 20:20:43,827 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In-1205222206 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In-1205222206 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-1205222206 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1205222206 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (or (and (or (and .cse0 (= ~y~0_In-1205222206 ~y~0_Out-1205222206)) (and (= ~y$w_buff1~0_In-1205222206 ~y~0_Out-1205222206) .cse1 .cse2)) .cse3) (and (= ~y$w_buff0~0_In-1205222206 ~y~0_Out-1205222206) .cse4 .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1205222206| ULTIMATE.start_assume_abort_if_not_~cond_Out-1205222206) (= ~y$r_buff0_thd0~0_Out-1205222206 ~y$r_buff0_thd0~0_In-1205222206) (or (and (= ~y$w_buff0_used~0_Out-1205222206 0) .cse4 .cse5) (and (= ~y$w_buff0_used~0_In-1205222206 ~y$w_buff0_used~0_Out-1205222206) .cse3)) (= ~y$r_buff1_thd0~0_In-1205222206 ~y$r_buff1_thd0~0_Out-1205222206) (or (and (= 0 ~y$w_buff1_used~0_Out-1205222206) .cse1 .cse2) (and .cse0 (= ~y$w_buff1_used~0_In-1205222206 ~y$w_buff1_used~0_Out-1205222206))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1205222206 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1205222206|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205222206, ~y$w_buff1~0=~y$w_buff1~0_In-1205222206, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1205222206, ~y$w_buff0~0=~y$w_buff0~0_In-1205222206, ~y~0=~y~0_In-1205222206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1205222206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205222206} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1205222206, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1205222206|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1205222206|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1205222206|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1205222206|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1205222206|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1205222206|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1205222206|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1205222206, ~y$w_buff1~0=~y$w_buff1~0_In-1205222206, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1205222206, ~y$w_buff0~0=~y$w_buff0~0_In-1205222206, ~y~0=~y~0_Out-1205222206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1205222206, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1205222206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-29 20:20:43,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,831 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-11-29 20:20:43,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,837 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,837 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,838 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,843 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,853 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:20:43 BasicIcfg [2020-11-29 20:20:43,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:20:43,942 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:20:43,942 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:20:43,942 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:20:43,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:20:28" (3/4) ... [2020-11-29 20:20:43,945 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 20:20:43,952 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In-1205222206 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In-1205222206 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-1205222206 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1205222206 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (or (and (or (and .cse0 (= ~y~0_In-1205222206 ~y~0_Out-1205222206)) (and (= ~y$w_buff1~0_In-1205222206 ~y~0_Out-1205222206) .cse1 .cse2)) .cse3) (and (= ~y$w_buff0~0_In-1205222206 ~y~0_Out-1205222206) .cse4 .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1205222206| ULTIMATE.start_assume_abort_if_not_~cond_Out-1205222206) (= ~y$r_buff0_thd0~0_Out-1205222206 ~y$r_buff0_thd0~0_In-1205222206) (or (and (= ~y$w_buff0_used~0_Out-1205222206 0) .cse4 .cse5) (and (= ~y$w_buff0_used~0_In-1205222206 ~y$w_buff0_used~0_Out-1205222206) .cse3)) (= ~y$r_buff1_thd0~0_In-1205222206 ~y$r_buff1_thd0~0_Out-1205222206) (or (and (= 0 ~y$w_buff1_used~0_Out-1205222206) .cse1 .cse2) (and .cse0 (= ~y$w_buff1_used~0_In-1205222206 ~y$w_buff1_used~0_Out-1205222206))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1205222206 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1205222206|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1205222206, ~y$w_buff1~0=~y$w_buff1~0_In-1205222206, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1205222206, ~y$w_buff0~0=~y$w_buff0~0_In-1205222206, ~y~0=~y~0_In-1205222206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1205222206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1205222206} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1205222206, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1205222206|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1205222206|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1205222206|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1205222206|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1205222206|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1205222206|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1205222206|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1205222206, ~y$w_buff1~0=~y$w_buff1~0_In-1205222206, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1205222206, ~y$w_buff0~0=~y$w_buff0~0_In-1205222206, ~y~0=~y~0_Out-1205222206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1205222206, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1205222206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-29 20:20:43,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,954 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-11-29 20:20:43,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:43,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 20:20:43,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:20:44,044 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0af2eeb3-b52e-4b8c-a1f9-e405ad0e5a0e/bin/uautomizer/witness.graphml [2020-11-29 20:20:44,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:20:44,045 INFO L168 Benchmark]: Toolchain (without parser) took 19432.24 ms. Allocated memory was 88.1 MB in the beginning and 339.7 MB in the end (delta: 251.7 MB). Free memory was 59.4 MB in the beginning and 207.1 MB in the end (delta: -147.7 MB). Peak memory consumption was 102.5 MB. Max. memory is 16.1 GB. [2020-11-29 20:20:44,046 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 88.1 MB. Free memory was 45.8 MB in the beginning and 45.8 MB in the end (delta: 40.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:20:44,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.00 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 59.1 MB in the beginning and 71.1 MB in the end (delta: -12.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-29 20:20:44,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.09 ms. Allocated memory is still 117.4 MB. Free memory was 70.4 MB in the beginning and 67.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:20:44,049 INFO L168 Benchmark]: Boogie Preprocessor took 60.52 ms. Allocated memory is still 117.4 MB. Free memory was 67.7 MB in the beginning and 65.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:20:44,049 INFO L168 Benchmark]: RCFGBuilder took 2874.92 ms. Allocated memory was 117.4 MB in the beginning and 146.8 MB in the end (delta: 29.4 MB). Free memory was 65.6 MB in the beginning and 93.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. [2020-11-29 20:20:44,050 INFO L168 Benchmark]: TraceAbstraction took 15549.70 ms. Allocated memory was 146.8 MB in the beginning and 339.7 MB in the end (delta: 192.9 MB). Free memory was 92.6 MB in the beginning and 221.8 MB in the end (delta: -129.2 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.1 GB. [2020-11-29 20:20:44,050 INFO L168 Benchmark]: Witness Printer took 102.28 ms. Allocated memory is still 339.7 MB. Free memory was 221.8 MB in the beginning and 207.1 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-29 20:20:44,053 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.18 ms. Allocated memory is still 88.1 MB. Free memory was 45.8 MB in the beginning and 45.8 MB in the end (delta: 40.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 769.00 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 59.1 MB in the beginning and 71.1 MB in the end (delta: -12.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.09 ms. Allocated memory is still 117.4 MB. Free memory was 70.4 MB in the beginning and 67.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.52 ms. Allocated memory is still 117.4 MB. Free memory was 67.7 MB in the beginning and 65.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2874.92 ms. Allocated memory was 117.4 MB in the beginning and 146.8 MB in the end (delta: 29.4 MB). Free memory was 65.6 MB in the beginning and 93.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15549.70 ms. Allocated memory was 146.8 MB in the beginning and 339.7 MB in the end (delta: 192.9 MB). Free memory was 92.6 MB in the beginning and 221.8 MB in the end (delta: -129.2 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.1 GB. * Witness Printer took 102.28 ms. Allocated memory is still 339.7 MB. Free memory was 221.8 MB in the beginning and 207.1 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1170 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.1s, 103 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4794 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2183; [L814] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2184; [L816] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2185; [L818] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe017_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 312 SDtfs, 348 SDslu, 542 SDs, 0 SdLazy, 382 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 104 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 28850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...