./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f2a18299b5719965a95e3debd3a405b904a3055 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-9a8b2e8 [2020-10-20 03:03:20,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:03:20,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:03:20,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:03:20,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:03:20,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:03:20,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:03:20,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:03:20,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:03:20,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:03:20,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:03:20,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:03:20,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:03:20,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:03:20,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:03:20,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:03:20,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:03:20,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:03:20,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:03:20,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:03:20,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:03:20,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:03:20,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:03:20,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:03:20,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:03:20,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:03:20,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:03:20,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:03:20,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:03:20,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:03:20,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:03:20,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:03:20,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:03:20,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:03:20,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:03:20,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:03:20,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:03:20,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:03:20,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:03:20,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:03:20,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:03:20,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:03:20,634 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:03:20,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:03:20,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:03:20,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:03:20,636 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:03:20,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:03:20,637 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:03:20,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:03:20,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:03:20,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:03:20,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:03:20,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:03:20,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:03:20,640 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:03:20,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:03:20,641 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:03:20,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:03:20,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:03:20,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:03:20,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:03:20,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:03:20,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:03:20,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:03:20,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:03:20,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:03:20,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:03:20,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:03:20,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:03:20,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:03:20,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f2a18299b5719965a95e3debd3a405b904a3055 [2020-10-20 03:03:20,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:03:20,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:03:20,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:03:20,928 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:03:20,932 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:03:20,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_rmo.opt.i [2020-10-20 03:03:21,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e4b4971/ac7bb30bfd984c4995c8da4fb4e1a29a/FLAG5f550ea13 [2020-10-20 03:03:21,629 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:03:21,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_rmo.opt.i [2020-10-20 03:03:21,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e4b4971/ac7bb30bfd984c4995c8da4fb4e1a29a/FLAG5f550ea13 [2020-10-20 03:03:21,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e4b4971/ac7bb30bfd984c4995c8da4fb4e1a29a [2020-10-20 03:03:21,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:03:21,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:03:21,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:03:21,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:03:21,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:03:21,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:03:21" (1/1) ... [2020-10-20 03:03:21,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bf95df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:21, skipping insertion in model container [2020-10-20 03:03:21,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:03:21" (1/1) ... [2020-10-20 03:03:21,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:03:21,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:03:22,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:03:22,518 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:03:22,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:03:22,719 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:03:22,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22 WrapperNode [2020-10-20 03:03:22,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:03:22,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:03:22,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:03:22,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:03:22,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:03:22,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:03:22,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:03:22,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:03:22,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... [2020-10-20 03:03:22,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:03:22,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:03:22,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:03:22,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:03:22,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:03:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:03:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:03:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:03:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:03:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:03:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:03:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:03:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:03:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:03:22,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:03:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:03:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:03:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:03:22,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:03:22,924 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:03:25,235 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:03:25,235 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 03:03:25,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:25 BoogieIcfgContainer [2020-10-20 03:03:25,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:03:25,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:03:25,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:03:25,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:03:25,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:03:21" (1/3) ... [2020-10-20 03:03:25,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d5198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:03:25, skipping insertion in model container [2020-10-20 03:03:25,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:03:22" (2/3) ... [2020-10-20 03:03:25,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d5198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:03:25, skipping insertion in model container [2020-10-20 03:03:25,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:25" (3/3) ... [2020-10-20 03:03:25,247 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2020-10-20 03:03:25,259 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:03:25,259 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:03:25,267 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 03:03:25,268 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:03:25,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,299 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,304 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,307 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,307 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,320 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:03:25,327 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:03:25,341 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-20 03:03:25,363 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:03:25,363 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:03:25,363 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:03:25,363 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:03:25,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:03:25,364 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:03:25,364 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:03:25,364 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:03:25,378 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:03:25,382 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-20 03:03:25,384 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-20 03:03:25,386 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-20 03:03:25,441 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-20 03:03:25,441 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:03:25,447 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-20 03:03:25,450 INFO L117 LiptonReduction]: Number of co-enabled transitions 1862 [2020-10-20 03:03:25,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:25,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:25,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:25,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:25,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:25,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:25,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:25,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:25,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:25,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:25,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:25,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:25,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:25,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:25,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-20 03:03:25,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:03:25,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:25,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:03:25,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:26,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-20 03:03:26,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:03:26,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-20 03:03:26,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:26,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:26,500 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-20 03:03:26,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:26,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:26,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:26,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-20 03:03:26,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:03:26,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-20 03:03:26,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:26,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:26,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:26,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:26,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-20 03:03:26,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:26,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:26,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-20 03:03:26,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:26,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:26,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:26,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:26,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:26,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-20 03:03:26,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:26,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-20 03:03:26,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:26,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-20 03:03:26,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:03:26,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-20 03:03:26,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:03:26,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:26,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:03:26,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:03:26,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:03:26,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-20 03:03:26,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:26,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:26,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:28,450 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-20 03:03:28,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-20 03:03:28,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:28,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:03:28,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:29,669 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-20 03:03:29,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:29,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:29,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:29,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:29,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:29,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:29,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:29,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:29,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:29,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:29,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:03:30,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:30,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:30,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:30,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:30,686 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-20 03:03:30,804 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-20 03:03:31,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:31,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:31,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:31,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:31,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:03:31,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:03:32,494 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-20 03:03:32,795 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-20 03:03:33,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-20 03:03:33,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:03:33,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-20 03:03:33,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:33,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-20 03:03:33,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:33,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-20 03:03:33,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:33,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:33,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:33,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:33,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:03:33,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:33,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:33,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:33,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:33,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-20 03:03:33,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:33,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:33,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:33,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:03:33,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:03:34,004 WARN L193 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 132 [2020-10-20 03:03:34,316 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-20 03:03:34,739 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-20 03:03:34,919 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-20 03:03:34,976 INFO L132 LiptonReduction]: Checked pairs total: 5104 [2020-10-20 03:03:34,976 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-20 03:03:34,984 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-20 03:03:35,043 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-20 03:03:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-20 03:03:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-20 03:03:35,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:35,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-20 03:03:35,055 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:35,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1048842805, now seen corresponding path program 1 times [2020-10-20 03:03:35,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:35,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816733464] [2020-10-20 03:03:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:35,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816733464] [2020-10-20 03:03:35,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:35,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:03:35,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595179002] [2020-10-20 03:03:35,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:03:35,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:35,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:03:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:03:35,398 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-20 03:03:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:35,526 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-20 03:03:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:03:35,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-20 03:03:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:35,572 INFO L225 Difference]: With dead ends: 687 [2020-10-20 03:03:35,572 INFO L226 Difference]: Without dead ends: 562 [2020-10-20 03:03:35,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:03:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-20 03:03:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-20 03:03:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-20 03:03:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-20 03:03:35,670 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-20 03:03:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:35,670 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-20 03:03:35,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:03:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-20 03:03:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 03:03:35,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:35,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:35,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:03:35,674 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1612320360, now seen corresponding path program 1 times [2020-10-20 03:03:35,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:35,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128113784] [2020-10-20 03:03:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:35,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128113784] [2020-10-20 03:03:35,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:35,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:03:35,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046583822] [2020-10-20 03:03:35,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:35,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:35,795 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-10-20 03:03:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:36,108 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-20 03:03:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:03:36,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-20 03:03:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:36,115 INFO L225 Difference]: With dead ends: 552 [2020-10-20 03:03:36,115 INFO L226 Difference]: Without dead ends: 552 [2020-10-20 03:03:36,116 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-10-20 03:03:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-20 03:03:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-20 03:03:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-20 03:03:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-20 03:03:36,144 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-20 03:03:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:36,145 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-20 03:03:36,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-20 03:03:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:03:36,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:36,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:36,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:03:36,148 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1557278652, now seen corresponding path program 1 times [2020-10-20 03:03:36,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:36,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175874031] [2020-10-20 03:03:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:36,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175874031] [2020-10-20 03:03:36,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:36,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:03:36,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687866596] [2020-10-20 03:03:36,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:03:36,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:36,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:03:36,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:03:36,272 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-20 03:03:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:36,292 INFO L93 Difference]: Finished difference Result 512 states and 1545 transitions. [2020-10-20 03:03:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:03:36,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 03:03:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:36,299 INFO L225 Difference]: With dead ends: 512 [2020-10-20 03:03:36,299 INFO L226 Difference]: Without dead ends: 512 [2020-10-20 03:03:36,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:03:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-10-20 03:03:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2020-10-20 03:03:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2020-10-20 03:03:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1545 transitions. [2020-10-20 03:03:36,318 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1545 transitions. Word has length 10 [2020-10-20 03:03:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:36,319 INFO L481 AbstractCegarLoop]: Abstraction has 512 states and 1545 transitions. [2020-10-20 03:03:36,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:03:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1545 transitions. [2020-10-20 03:03:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:03:36,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:36,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:36,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:03:36,323 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1030076192, now seen corresponding path program 1 times [2020-10-20 03:03:36,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:36,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400838343] [2020-10-20 03:03:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:36,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400838343] [2020-10-20 03:03:36,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:36,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:03:36,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358572412] [2020-10-20 03:03:36,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:36,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:36,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:36,393 INFO L87 Difference]: Start difference. First operand 512 states and 1545 transitions. Second operand 4 states. [2020-10-20 03:03:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:36,472 INFO L93 Difference]: Finished difference Result 557 states and 1686 transitions. [2020-10-20 03:03:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:03:36,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 03:03:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:36,478 INFO L225 Difference]: With dead ends: 557 [2020-10-20 03:03:36,478 INFO L226 Difference]: Without dead ends: 557 [2020-10-20 03:03:36,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-20 03:03:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-20 03:03:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-20 03:03:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1686 transitions. [2020-10-20 03:03:36,498 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1686 transitions. Word has length 11 [2020-10-20 03:03:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:36,499 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1686 transitions. [2020-10-20 03:03:36,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1686 transitions. [2020-10-20 03:03:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:03:36,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:36,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:36,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:03:36,501 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:36,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1882913860, now seen corresponding path program 1 times [2020-10-20 03:03:36,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:36,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533781811] [2020-10-20 03:03:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:36,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533781811] [2020-10-20 03:03:36,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:36,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:03:36,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359671922] [2020-10-20 03:03:36,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:36,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:36,574 INFO L87 Difference]: Start difference. First operand 557 states and 1686 transitions. Second operand 4 states. [2020-10-20 03:03:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:36,606 INFO L93 Difference]: Finished difference Result 782 states and 2346 transitions. [2020-10-20 03:03:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:03:36,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 03:03:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:36,611 INFO L225 Difference]: With dead ends: 782 [2020-10-20 03:03:36,611 INFO L226 Difference]: Without dead ends: 482 [2020-10-20 03:03:36,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-20 03:03:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-20 03:03:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-20 03:03:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1435 transitions. [2020-10-20 03:03:36,627 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1435 transitions. Word has length 12 [2020-10-20 03:03:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:36,627 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1435 transitions. [2020-10-20 03:03:36,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1435 transitions. [2020-10-20 03:03:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:03:36,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:36,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:36,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:03:36,629 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2015887913, now seen corresponding path program 1 times [2020-10-20 03:03:36,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:36,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405765721] [2020-10-20 03:03:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:36,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405765721] [2020-10-20 03:03:36,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:36,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:36,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105150633] [2020-10-20 03:03:36,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:36,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:36,690 INFO L87 Difference]: Start difference. First operand 482 states and 1435 transitions. Second operand 5 states. [2020-10-20 03:03:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:36,784 INFO L93 Difference]: Finished difference Result 470 states and 1394 transitions. [2020-10-20 03:03:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:36,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 03:03:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:36,788 INFO L225 Difference]: With dead ends: 470 [2020-10-20 03:03:36,788 INFO L226 Difference]: Without dead ends: 470 [2020-10-20 03:03:36,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-20 03:03:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2020-10-20 03:03:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-10-20 03:03:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1394 transitions. [2020-10-20 03:03:36,802 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1394 transitions. Word has length 12 [2020-10-20 03:03:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:36,803 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1394 transitions. [2020-10-20 03:03:36,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1394 transitions. [2020-10-20 03:03:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:03:36,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:36,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:36,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:03:36,804 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash 197915350, now seen corresponding path program 1 times [2020-10-20 03:03:36,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:36,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515052641] [2020-10-20 03:03:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:36,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515052641] [2020-10-20 03:03:36,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:36,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:03:36,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797858893] [2020-10-20 03:03:36,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:03:36,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:03:36,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:03:36,865 INFO L87 Difference]: Start difference. First operand 470 states and 1394 transitions. Second operand 3 states. [2020-10-20 03:03:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:36,889 INFO L93 Difference]: Finished difference Result 701 states and 2016 transitions. [2020-10-20 03:03:36,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:03:36,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-20 03:03:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:36,894 INFO L225 Difference]: With dead ends: 701 [2020-10-20 03:03:36,894 INFO L226 Difference]: Without dead ends: 497 [2020-10-20 03:03:36,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:03:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-10-20 03:03:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 461. [2020-10-20 03:03:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-10-20 03:03:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1296 transitions. [2020-10-20 03:03:36,908 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1296 transitions. Word has length 13 [2020-10-20 03:03:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:36,909 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 1296 transitions. [2020-10-20 03:03:36,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:03:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1296 transitions. [2020-10-20 03:03:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:03:36,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:36,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:36,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:03:36,910 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:36,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1347723981, now seen corresponding path program 1 times [2020-10-20 03:03:36,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:36,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557406340] [2020-10-20 03:03:36,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:36,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557406340] [2020-10-20 03:03:36,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:36,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:03:36,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845624931] [2020-10-20 03:03:36,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:03:36,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:03:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:36,996 INFO L87 Difference]: Start difference. First operand 461 states and 1296 transitions. Second operand 6 states. [2020-10-20 03:03:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:37,152 INFO L93 Difference]: Finished difference Result 593 states and 1663 transitions. [2020-10-20 03:03:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:03:37,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 03:03:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:37,155 INFO L225 Difference]: With dead ends: 593 [2020-10-20 03:03:37,156 INFO L226 Difference]: Without dead ends: 245 [2020-10-20 03:03:37,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:03:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-20 03:03:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2020-10-20 03:03:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-20 03:03:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 683 transitions. [2020-10-20 03:03:37,164 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 683 transitions. Word has length 13 [2020-10-20 03:03:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:37,165 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 683 transitions. [2020-10-20 03:03:37,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:03:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 683 transitions. [2020-10-20 03:03:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:03:37,166 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:37,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:37,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:03:37,166 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:37,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1840407851, now seen corresponding path program 1 times [2020-10-20 03:03:37,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:37,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946933716] [2020-10-20 03:03:37,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:37,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946933716] [2020-10-20 03:03:37,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:37,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:37,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274915169] [2020-10-20 03:03:37,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:37,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:37,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:37,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:37,304 INFO L87 Difference]: Start difference. First operand 245 states and 683 transitions. Second operand 5 states. [2020-10-20 03:03:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:37,394 INFO L93 Difference]: Finished difference Result 244 states and 679 transitions. [2020-10-20 03:03:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:03:37,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 03:03:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:37,397 INFO L225 Difference]: With dead ends: 244 [2020-10-20 03:03:37,398 INFO L226 Difference]: Without dead ends: 244 [2020-10-20 03:03:37,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-10-20 03:03:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2020-10-20 03:03:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-10-20 03:03:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 679 transitions. [2020-10-20 03:03:37,408 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 679 transitions. Word has length 14 [2020-10-20 03:03:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:37,408 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 679 transitions. [2020-10-20 03:03:37,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 679 transitions. [2020-10-20 03:03:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:03:37,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:37,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:37,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:03:37,411 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:37,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:37,411 INFO L82 PathProgramCache]: Analyzing trace with hash 950022406, now seen corresponding path program 1 times [2020-10-20 03:03:37,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:37,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019924638] [2020-10-20 03:03:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:37,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019924638] [2020-10-20 03:03:37,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:37,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:03:37,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366586682] [2020-10-20 03:03:37,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:03:37,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:03:37,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:03:37,530 INFO L87 Difference]: Start difference. First operand 244 states and 679 transitions. Second operand 4 states. [2020-10-20 03:03:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:37,562 INFO L93 Difference]: Finished difference Result 242 states and 591 transitions. [2020-10-20 03:03:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:03:37,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-20 03:03:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:37,564 INFO L225 Difference]: With dead ends: 242 [2020-10-20 03:03:37,564 INFO L226 Difference]: Without dead ends: 177 [2020-10-20 03:03:37,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-20 03:03:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-10-20 03:03:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-20 03:03:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 423 transitions. [2020-10-20 03:03:37,571 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 423 transitions. Word has length 15 [2020-10-20 03:03:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:37,571 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 423 transitions. [2020-10-20 03:03:37,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:03:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 423 transitions. [2020-10-20 03:03:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:03:37,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:37,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:37,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:03:37,572 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:37,573 INFO L82 PathProgramCache]: Analyzing trace with hash 256502321, now seen corresponding path program 1 times [2020-10-20 03:03:37,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:37,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472639489] [2020-10-20 03:03:37,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:37,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472639489] [2020-10-20 03:03:37,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:37,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:03:37,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239488245] [2020-10-20 03:03:37,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:03:37,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:37,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:03:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:03:37,660 INFO L87 Difference]: Start difference. First operand 177 states and 423 transitions. Second operand 5 states. [2020-10-20 03:03:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:37,706 INFO L93 Difference]: Finished difference Result 144 states and 304 transitions. [2020-10-20 03:03:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:37,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-20 03:03:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:37,709 INFO L225 Difference]: With dead ends: 144 [2020-10-20 03:03:37,709 INFO L226 Difference]: Without dead ends: 107 [2020-10-20 03:03:37,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:03:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-20 03:03:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-20 03:03:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-20 03:03:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 215 transitions. [2020-10-20 03:03:37,714 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 215 transitions. Word has length 16 [2020-10-20 03:03:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:37,715 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 215 transitions. [2020-10-20 03:03:37,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:03:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 215 transitions. [2020-10-20 03:03:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 03:03:37,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:37,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:37,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:03:37,716 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1023864462, now seen corresponding path program 1 times [2020-10-20 03:03:37,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:37,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129460052] [2020-10-20 03:03:37,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:37,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129460052] [2020-10-20 03:03:37,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:37,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:03:37,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385365659] [2020-10-20 03:03:37,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:03:37,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:03:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:37,819 INFO L87 Difference]: Start difference. First operand 107 states and 215 transitions. Second operand 6 states. [2020-10-20 03:03:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:37,903 INFO L93 Difference]: Finished difference Result 92 states and 183 transitions. [2020-10-20 03:03:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:03:37,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 03:03:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:37,905 INFO L225 Difference]: With dead ends: 92 [2020-10-20 03:03:37,905 INFO L226 Difference]: Without dead ends: 82 [2020-10-20 03:03:37,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:03:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-20 03:03:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-20 03:03:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-20 03:03:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 165 transitions. [2020-10-20 03:03:37,909 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 165 transitions. Word has length 18 [2020-10-20 03:03:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:37,909 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 165 transitions. [2020-10-20 03:03:37,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:03:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 165 transitions. [2020-10-20 03:03:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 03:03:37,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:37,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:37,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:03:37,911 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2015020648, now seen corresponding path program 1 times [2020-10-20 03:03:37,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:37,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816609263] [2020-10-20 03:03:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:38,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816609263] [2020-10-20 03:03:38,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:38,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:03:38,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900105485] [2020-10-20 03:03:38,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:03:38,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:03:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:03:38,115 INFO L87 Difference]: Start difference. First operand 82 states and 165 transitions. Second operand 6 states. [2020-10-20 03:03:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:38,224 INFO L93 Difference]: Finished difference Result 114 states and 226 transitions. [2020-10-20 03:03:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:03:38,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-20 03:03:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:38,226 INFO L225 Difference]: With dead ends: 114 [2020-10-20 03:03:38,227 INFO L226 Difference]: Without dead ends: 92 [2020-10-20 03:03:38,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:03:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-20 03:03:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2020-10-20 03:03:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 03:03:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 141 transitions. [2020-10-20 03:03:38,230 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 141 transitions. Word has length 21 [2020-10-20 03:03:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:38,231 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 141 transitions. [2020-10-20 03:03:38,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:03:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 141 transitions. [2020-10-20 03:03:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 03:03:38,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:38,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:38,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:03:38,232 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1226256408, now seen corresponding path program 2 times [2020-10-20 03:03:38,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:38,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435960580] [2020-10-20 03:03:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:03:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:03:38,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435960580] [2020-10-20 03:03:38,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:03:38,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:03:38,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884735563] [2020-10-20 03:03:38,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:03:38,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:03:38,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:03:38,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:03:38,679 INFO L87 Difference]: Start difference. First operand 74 states and 141 transitions. Second operand 8 states. [2020-10-20 03:03:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:03:38,795 INFO L93 Difference]: Finished difference Result 100 states and 189 transitions. [2020-10-20 03:03:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:03:38,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-20 03:03:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:03:38,796 INFO L225 Difference]: With dead ends: 100 [2020-10-20 03:03:38,796 INFO L226 Difference]: Without dead ends: 60 [2020-10-20 03:03:38,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:03:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-20 03:03:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-20 03:03:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 03:03:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2020-10-20 03:03:38,799 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 21 [2020-10-20 03:03:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:03:38,799 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2020-10-20 03:03:38,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:03:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2020-10-20 03:03:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 03:03:38,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:03:38,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:03:38,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:03:38,818 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:03:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:03:38,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1452915720, now seen corresponding path program 3 times [2020-10-20 03:03:38,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:03:38,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991846919] [2020-10-20 03:03:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:03:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:03:38,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:03:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:03:38,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:03:38,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:03:38,949 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:03:38,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 03:03:38,950 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 03:03:38,962 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-1995193949 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-1995193949 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1995193949 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1995193949 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out-1995193949 ~x$r_buff1_thd0~0_In-1995193949) (= (mod ~main$tmp_guard0~0_In-1995193949 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1995193949|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1995193949 0)) (or (and (= ~x$w_buff0_used~0_Out-1995193949 0) .cse0 .cse1) (and (= ~x$w_buff0_used~0_Out-1995193949 ~x$w_buff0_used~0_In-1995193949) .cse2)) (or (and .cse3 (= ~x$w_buff1_used~0_Out-1995193949 0) .cse4) (and (= ~x$w_buff1_used~0_In-1995193949 ~x$w_buff1_used~0_Out-1995193949) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1995193949 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1995193949|) (or (and (or (and .cse3 .cse4 (= ~x~0_Out-1995193949 ~x$w_buff1~0_In-1995193949)) (and .cse5 (= ~x~0_In-1995193949 ~x~0_Out-1995193949))) .cse2) (and .cse0 (= ~x$w_buff0~0_In-1995193949 ~x~0_Out-1995193949) .cse1)) (= ~x$r_buff0_thd0~0_In-1995193949 ~x$r_buff0_thd0~0_Out-1995193949)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1995193949, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995193949, ~x$w_buff1~0=~x$w_buff1~0_In-1995193949, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1995193949, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1995193949, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1995193949, ~x~0=~x~0_In-1995193949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995193949} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1995193949, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1995193949, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1995193949|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1995193949|, ~x$w_buff1~0=~x$w_buff1~0_In-1995193949, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1995193949, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1995193949|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1995193949|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1995193949, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1995193949|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1995193949, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1995193949, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1995193949|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1995193949|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1995193949, ~x~0=~x~0_Out-1995193949} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-20 03:03:38,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,968 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-10-20 03:03:38,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,971 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,974 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,974 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,975 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,975 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,975 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,976 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,976 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,977 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,977 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,977 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,977 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,978 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,978 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,978 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,979 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,979 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,979 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:38,980 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:38,980 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:03:39 BasicIcfg [2020-10-20 03:03:39,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:03:39,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:03:39,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:03:39,062 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:03:39,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:03:25" (3/4) ... [2020-10-20 03:03:39,064 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:03:39,071 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-1995193949 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-1995193949 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1995193949 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1995193949 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out-1995193949 ~x$r_buff1_thd0~0_In-1995193949) (= (mod ~main$tmp_guard0~0_In-1995193949 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1995193949|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1995193949 0)) (or (and (= ~x$w_buff0_used~0_Out-1995193949 0) .cse0 .cse1) (and (= ~x$w_buff0_used~0_Out-1995193949 ~x$w_buff0_used~0_In-1995193949) .cse2)) (or (and .cse3 (= ~x$w_buff1_used~0_Out-1995193949 0) .cse4) (and (= ~x$w_buff1_used~0_In-1995193949 ~x$w_buff1_used~0_Out-1995193949) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1995193949 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1995193949|) (or (and (or (and .cse3 .cse4 (= ~x~0_Out-1995193949 ~x$w_buff1~0_In-1995193949)) (and .cse5 (= ~x~0_In-1995193949 ~x~0_Out-1995193949))) .cse2) (and .cse0 (= ~x$w_buff0~0_In-1995193949 ~x~0_Out-1995193949) .cse1)) (= ~x$r_buff0_thd0~0_In-1995193949 ~x$r_buff0_thd0~0_Out-1995193949)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1995193949, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995193949, ~x$w_buff1~0=~x$w_buff1~0_In-1995193949, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1995193949, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1995193949, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1995193949, ~x~0=~x~0_In-1995193949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995193949} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1995193949, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1995193949, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1995193949|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1995193949|, ~x$w_buff1~0=~x$w_buff1~0_In-1995193949, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1995193949, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1995193949|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1995193949|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1995193949, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1995193949|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1995193949, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1995193949, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1995193949|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1995193949|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1995193949, ~x~0=~x~0_Out-1995193949} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-20 03:03:39,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,073 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-10-20 03:03:39,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,075 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,076 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,076 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,076 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,076 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,077 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,077 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,077 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,077 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,078 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,078 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,078 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,081 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:03:39,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:03:39,211 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:03:39,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:03:39,213 INFO L168 Benchmark]: Toolchain (without parser) took 17382.98 ms. Allocated memory was 35.7 MB in the beginning and 148.4 MB in the end (delta: 112.7 MB). Free memory was 13.9 MB in the beginning and 55.3 MB in the end (delta: -41.4 MB). Peak memory consumption was 71.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,213 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 33.6 MB. Free memory was 9.5 MB in the beginning and 9.5 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.21 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 13.1 MB in the beginning and 13.7 MB in the end (delta: -583.5 kB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.15 ms. Allocated memory was 44.0 MB in the beginning and 46.7 MB in the end (delta: 2.6 MB). Free memory was 13.7 MB in the beginning and 28.6 MB in the end (delta: -14.9 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,215 INFO L168 Benchmark]: Boogie Preprocessor took 40.55 ms. Allocated memory is still 46.7 MB. Free memory was 28.6 MB in the beginning and 26.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,215 INFO L168 Benchmark]: RCFGBuilder took 2399.92 ms. Allocated memory was 46.7 MB in the beginning and 73.4 MB in the end (delta: 26.7 MB). Free memory was 26.2 MB in the beginning and 38.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 41.8 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,215 INFO L168 Benchmark]: TraceAbstraction took 13822.18 ms. Allocated memory was 73.4 MB in the beginning and 148.4 MB in the end (delta: 75.0 MB). Free memory was 37.8 MB in the beginning and 73.2 MB in the end (delta: -35.4 MB). Peak memory consumption was 39.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,216 INFO L168 Benchmark]: Witness Printer took 150.25 ms. Allocated memory is still 148.4 MB. Free memory was 73.2 MB in the beginning and 55.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 14.3 GB. [2020-10-20 03:03:39,220 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.97 ms. Allocated memory is still 33.6 MB. Free memory was 9.5 MB in the beginning and 9.5 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 882.21 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 13.1 MB in the beginning and 13.7 MB in the end (delta: -583.5 kB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 76.15 ms. Allocated memory was 44.0 MB in the beginning and 46.7 MB in the end (delta: 2.6 MB). Free memory was 13.7 MB in the beginning and 28.6 MB in the end (delta: -14.9 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 40.55 ms. Allocated memory is still 46.7 MB. Free memory was 28.6 MB in the beginning and 26.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2399.92 ms. Allocated memory was 46.7 MB in the beginning and 73.4 MB in the end (delta: 26.7 MB). Free memory was 26.2 MB in the beginning and 38.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 41.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 13822.18 ms. Allocated memory was 73.4 MB in the beginning and 148.4 MB in the end (delta: 75.0 MB). Free memory was 37.8 MB in the beginning and 73.2 MB in the end (delta: -35.4 MB). Peak memory consumption was 39.5 MB. Max. memory is 14.3 GB. * Witness Printer took 150.25 ms. Allocated memory is still 148.4 MB. Free memory was 73.2 MB in the beginning and 55.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1321 VarBasedMoverChecksPositive, 87 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 123 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.5s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 5104 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; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1888; [L819] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1889; [L821] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1890; [L823] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L741] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe004_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 268 SDtfs, 431 SDslu, 353 SDs, 0 SdLazy, 277 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred 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, 14 MinimizatonAttempts, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 21739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...