./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_pso.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/safe017_pso.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 8a21fc68f2496c8dbb26a40474d00d7d7595d751 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:05:19,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:05:19,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:05:19,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:05:19,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:05:19,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:05:19,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:05:19,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:05:19,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:05:19,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:05:19,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:05:19,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:05:19,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:05:19,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:05:19,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:05:19,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:05:19,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:05:19,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:05:19,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:05:19,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:05:19,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:05:19,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:05:19,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:05:19,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:05:19,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:05:19,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:05:19,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:05:19,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:05:19,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:05:19,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:05:19,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:05:19,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:05:19,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:05:19,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:05:19,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:05:19,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:05:19,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:05:19,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:05:19,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:05:19,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:05:19,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:05:19,836 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:05:19,871 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:05:19,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:05:19,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:05:19,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:05:19,874 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:05:19,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:05:19,875 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:05:19,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:05:19,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:05:19,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:05:19,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:05:19,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:05:19,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:05:19,878 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:05:19,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:05:19,878 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:05:19,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:05:19,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:05:19,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:05:19,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:05:19,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:05:19,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:05:19,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:05:19,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:05:19,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:05:19,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:05:19,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:05:19,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:05:19,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:05:19,883 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 -> 8a21fc68f2496c8dbb26a40474d00d7d7595d751 [2020-10-20 03:05:20,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:05:20,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:05:20,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:05:20,121 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:05:20,122 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:05:20,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_pso.opt.i [2020-10-20 03:05:20,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815b8fb75/edda6b2f974a428fa8673b54b970f51f/FLAG5cac2a263 [2020-10-20 03:05:20,884 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:05:20,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_pso.opt.i [2020-10-20 03:05:20,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815b8fb75/edda6b2f974a428fa8673b54b970f51f/FLAG5cac2a263 [2020-10-20 03:05:21,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815b8fb75/edda6b2f974a428fa8673b54b970f51f [2020-10-20 03:05:21,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:05:21,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:05:21,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:05:21,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:05:21,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:05:21,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:21,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581afb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21, skipping insertion in model container [2020-10-20 03:05:21,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:21,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:05:21,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:05:21,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:05:21,677 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:05:21,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:05:21,909 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:05:21,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21 WrapperNode [2020-10-20 03:05:21,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:05:21,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:05:21,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:05:21,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:05:21,921 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:05:21" (1/1) ... [2020-10-20 03:05:21,942 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:05:21" (1/1) ... [2020-10-20 03:05:21,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:05:21,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:05:21,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:05:21,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:05:22,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:22,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:22,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:22,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:22,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:22,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:22,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (1/1) ... [2020-10-20 03:05:22,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:05:22,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:05:22,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:05:22,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:05:22,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (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:05:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:05:22,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:05:22,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:05:22,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:05:22,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:05:22,135 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:05:24,391 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:05:24,391 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 03:05:24,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:05:24 BoogieIcfgContainer [2020-10-20 03:05:24,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:05:24,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:05:24,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:05:24,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:05:24,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:05:21" (1/3) ... [2020-10-20 03:05:24,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb91d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:05:24, skipping insertion in model container [2020-10-20 03:05:24,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:05:21" (2/3) ... [2020-10-20 03:05:24,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb91d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:05:24, skipping insertion in model container [2020-10-20 03:05:24,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:05:24" (3/3) ... [2020-10-20 03:05:24,403 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2020-10-20 03:05:24,416 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:05:24,416 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:05:24,425 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 03:05:24,426 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:05:24,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,458 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,458 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,459 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,472 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,473 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,478 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,478 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:05:24,487 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:05:24,502 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-20 03:05:24,521 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:05:24,521 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:05:24,521 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:05:24,521 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:05:24,521 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:05:24,521 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:05:24,522 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:05:24,522 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:05:24,536 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:05:24,539 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-20 03:05:24,542 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-20 03:05:24,544 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-10-20 03:05:24,612 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-10-20 03:05:24,612 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:05:24,618 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-20 03:05:24,621 INFO L117 LiptonReduction]: Number of co-enabled transitions 1770 [2020-10-20 03:05:24,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:24,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:24,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:24,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:24,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:24,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:05:24,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:24,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:24,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:24,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:24,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:24,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:24,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:24,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:24,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:24,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:25,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:25,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:25,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:25,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:25,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:25,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:25,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:25,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:25,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:25,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:05:25,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:25,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,771 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-20 03:05:25,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:25,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:25,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:05:25,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:25,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:25,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:25,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:25,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:25,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:25,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:25,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:26,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:26,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-20 03:05:26,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:26,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:26,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:26,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:26,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:26,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:05:26,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:26,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:26,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:26,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:26,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:26,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:05:26,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:26,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:26,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:05:26,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:26,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:26,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:26,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:05:26,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:05:26,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-20 03:05:26,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:26,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:26,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-20 03:05:27,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-20 03:05:27,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:27,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:27,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-20 03:05:27,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:27,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:05:27,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:27,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:27,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:28,415 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-20 03:05:28,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-20 03:05:28,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:28,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:05:28,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,261 WARN L193 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2020-10-20 03:05:29,602 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-20 03:05:29,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:29,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-20 03:05:29,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:29,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:29,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:29,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:29,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:29,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:29,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:29,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:29,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-20 03:05:29,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:29,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:29,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:29,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:30,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-20 03:05:30,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-20 03:05:30,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:30,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-20 03:05:30,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:30,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:30,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:30,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:30,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:30,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:30,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-20 03:05:30,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:05:30,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:30,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:30,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:30,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:30,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:30,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:30,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:30,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:30,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:30,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:30,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:30,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:31,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:31,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:31,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:31,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:31,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:31,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:31,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:31,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:31,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:31,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:31,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:31,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:31,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:31,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:31,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:31,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:31,707 WARN L193 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-20 03:05:31,985 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-20 03:05:31,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 3, 6, 3, 2, 1] term [2020-10-20 03:05:31,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:31,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 3, 6, 3, 2, 1] term [2020-10-20 03:05:32,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:32,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 2, 2, 1] term [2020-10-20 03:05:32,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:32,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 3, 2, 1] term [2020-10-20 03:05:32,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:32,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:32,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:32,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:32,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:32,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:32,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:32,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:32,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:32,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 6, 3, 6, 3, 2, 1] term [2020-10-20 03:05:32,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:32,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:32,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:32,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:32,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:33,004 WARN L193 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-20 03:05:33,355 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-20 03:05:33,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:33,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:33,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:33,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:33,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:33,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:33,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:33,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:33,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:33,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:33,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:33,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:33,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:33,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:33,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:33,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:33,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:33,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:33,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:33,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:33,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:33,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:33,843 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-10-20 03:05:34,018 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-20 03:05:34,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:34,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:05:34,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:34,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:34,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:05:34,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-10-20 03:05:34,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:05:34,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:05:34,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:05:34,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:05:34,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:05:34,504 INFO L132 LiptonReduction]: Checked pairs total: 4794 [2020-10-20 03:05:34,504 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-20 03:05:34,528 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-10-20 03:05:34,623 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-20 03:05:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-20 03:05:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-20 03:05:34,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:34,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-20 03:05:34,642 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times [2020-10-20 03:05:34,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:34,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464985642] [2020-10-20 03:05:34,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:35,026 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:05:35,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464985642] [2020-10-20 03:05:35,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:35,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:05:35,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223707480] [2020-10-20 03:05:35,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:05:35,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:05:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:05:35,071 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-20 03:05:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:35,244 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-20 03:05:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:05:35,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-20 03:05:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:35,294 INFO L225 Difference]: With dead ends: 552 [2020-10-20 03:05:35,295 INFO L226 Difference]: Without dead ends: 452 [2020-10-20 03:05:35,301 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:05:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-20 03:05:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-20 03:05:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-20 03:05:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-20 03:05:35,478 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-20 03:05:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:35,479 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-20 03:05:35,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:05:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-20 03:05:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 03:05:35,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:35,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:35,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:05:35,485 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times [2020-10-20 03:05:35,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:35,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864829879] [2020-10-20 03:05:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:35,722 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:05:35,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864829879] [2020-10-20 03:05:35,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:35,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:05:35,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226589200] [2020-10-20 03:05:35,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:35,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:35,726 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 4 states. [2020-10-20 03:05:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:35,824 INFO L93 Difference]: Finished difference Result 444 states and 1332 transitions. [2020-10-20 03:05:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:05:35,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-20 03:05:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:35,829 INFO L225 Difference]: With dead ends: 444 [2020-10-20 03:05:35,830 INFO L226 Difference]: Without dead ends: 444 [2020-10-20 03:05:35,831 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:05:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-10-20 03:05:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2020-10-20 03:05:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-20 03:05:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1332 transitions. [2020-10-20 03:05:35,850 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1332 transitions. Word has length 9 [2020-10-20 03:05:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:35,851 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1332 transitions. [2020-10-20 03:05:35,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1332 transitions. [2020-10-20 03:05:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:05:35,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:35,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:35,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:05:35,854 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash 528518820, now seen corresponding path program 1 times [2020-10-20 03:05:35,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:35,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053518601] [2020-10-20 03:05:35,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:35,915 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:05:35,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053518601] [2020-10-20 03:05:35,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:35,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:05:35,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960709229] [2020-10-20 03:05:35,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:05:35,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:35,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:05:35,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:05:35,918 INFO L87 Difference]: Start difference. First operand 444 states and 1332 transitions. Second operand 3 states. [2020-10-20 03:05:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:35,943 INFO L93 Difference]: Finished difference Result 428 states and 1276 transitions. [2020-10-20 03:05:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:05:35,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 03:05:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:35,948 INFO L225 Difference]: With dead ends: 428 [2020-10-20 03:05:35,948 INFO L226 Difference]: Without dead ends: 428 [2020-10-20 03:05:35,949 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:05:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-10-20 03:05:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2020-10-20 03:05:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-10-20 03:05:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1276 transitions. [2020-10-20 03:05:35,966 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1276 transitions. Word has length 10 [2020-10-20 03:05:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:35,967 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 1276 transitions. [2020-10-20 03:05:35,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:05:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1276 transitions. [2020-10-20 03:05:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:05:35,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:35,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:35,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:05:35,975 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash -795853152, now seen corresponding path program 1 times [2020-10-20 03:05:35,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:35,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213987215] [2020-10-20 03:05:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:36,111 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:05:36,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213987215] [2020-10-20 03:05:36,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:36,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:05:36,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738600549] [2020-10-20 03:05:36,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:36,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:36,113 INFO L87 Difference]: Start difference. First operand 428 states and 1276 transitions. Second operand 4 states. [2020-10-20 03:05:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:36,213 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-10-20 03:05:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:36,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 03:05:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:36,226 INFO L225 Difference]: With dead ends: 421 [2020-10-20 03:05:36,226 INFO L226 Difference]: Without dead ends: 421 [2020-10-20 03:05:36,227 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:05:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-20 03:05:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-20 03:05:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-20 03:05:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-10-20 03:05:36,259 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-10-20 03:05:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:36,260 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-10-20 03:05:36,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-10-20 03:05:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:05:36,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:36,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:36,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:05:36,262 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 313291130, now seen corresponding path program 1 times [2020-10-20 03:05:36,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:36,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083475725] [2020-10-20 03:05:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:36,413 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:05:36,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083475725] [2020-10-20 03:05:36,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:36,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:05:36,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933453445] [2020-10-20 03:05:36,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:05:36,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:05:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:05:36,415 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 5 states. [2020-10-20 03:05:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:36,463 INFO L93 Difference]: Finished difference Result 418 states and 1238 transitions. [2020-10-20 03:05:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:05:36,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 03:05:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:36,468 INFO L225 Difference]: With dead ends: 418 [2020-10-20 03:05:36,469 INFO L226 Difference]: Without dead ends: 418 [2020-10-20 03:05:36,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:05:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-10-20 03:05:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-10-20 03:05:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-20 03:05:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1238 transitions. [2020-10-20 03:05:36,486 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1238 transitions. Word has length 12 [2020-10-20 03:05:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:36,486 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1238 transitions. [2020-10-20 03:05:36,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:05:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1238 transitions. [2020-10-20 03:05:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:05:36,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:36,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:36,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:05:36,489 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times [2020-10-20 03:05:36,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:36,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738320479] [2020-10-20 03:05:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:36,661 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:05:36,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738320479] [2020-10-20 03:05:36,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:36,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:05:36,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820398988] [2020-10-20 03:05:36,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:05:36,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:05:36,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:05:36,663 INFO L87 Difference]: Start difference. First operand 418 states and 1238 transitions. Second operand 5 states. [2020-10-20 03:05:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:36,789 INFO L93 Difference]: Finished difference Result 417 states and 1233 transitions. [2020-10-20 03:05:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:36,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 03:05:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:36,794 INFO L225 Difference]: With dead ends: 417 [2020-10-20 03:05:36,795 INFO L226 Difference]: Without dead ends: 417 [2020-10-20 03:05:36,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-10-20 03:05:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 409. [2020-10-20 03:05:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-10-20 03:05:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1208 transitions. [2020-10-20 03:05:36,812 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1208 transitions. Word has length 12 [2020-10-20 03:05:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:36,813 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1208 transitions. [2020-10-20 03:05:36,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:05:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1208 transitions. [2020-10-20 03:05:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:05:36,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:36,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:36,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:05:36,815 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times [2020-10-20 03:05:36,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:36,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100869504] [2020-10-20 03:05:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:36,948 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:05:36,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100869504] [2020-10-20 03:05:36,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:36,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:05:36,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014911328] [2020-10-20 03:05:36,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:05:36,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:36,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:05:36,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:36,951 INFO L87 Difference]: Start difference. First operand 409 states and 1208 transitions. Second operand 6 states. [2020-10-20 03:05:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:37,081 INFO L93 Difference]: Finished difference Result 405 states and 1194 transitions. [2020-10-20 03:05:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:37,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 03:05:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:37,086 INFO L225 Difference]: With dead ends: 405 [2020-10-20 03:05:37,087 INFO L226 Difference]: Without dead ends: 405 [2020-10-20 03:05:37,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:05:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2020-10-20 03:05:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2020-10-20 03:05:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-10-20 03:05:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1194 transitions. [2020-10-20 03:05:37,106 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1194 transitions. Word has length 13 [2020-10-20 03:05:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:37,107 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 1194 transitions. [2020-10-20 03:05:37,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:05:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1194 transitions. [2020-10-20 03:05:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:05:37,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:37,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:37,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:05:37,110 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1122009596, now seen corresponding path program 1 times [2020-10-20 03:05:37,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:37,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276926440] [2020-10-20 03:05:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:37,216 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:05:37,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276926440] [2020-10-20 03:05:37,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:37,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:05:37,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767149677] [2020-10-20 03:05:37,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:05:37,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:37,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:05:37,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:37,219 INFO L87 Difference]: Start difference. First operand 405 states and 1194 transitions. Second operand 6 states. [2020-10-20 03:05:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:37,341 INFO L93 Difference]: Finished difference Result 452 states and 1327 transitions. [2020-10-20 03:05:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:37,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 03:05:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:37,347 INFO L225 Difference]: With dead ends: 452 [2020-10-20 03:05:37,347 INFO L226 Difference]: Without dead ends: 452 [2020-10-20 03:05:37,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-20 03:05:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 444. [2020-10-20 03:05:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-20 03:05:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1309 transitions. [2020-10-20 03:05:37,365 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1309 transitions. Word has length 13 [2020-10-20 03:05:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:37,366 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1309 transitions. [2020-10-20 03:05:37,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:05:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1309 transitions. [2020-10-20 03:05:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:05:37,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:37,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:37,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:05:37,368 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash -313686143, now seen corresponding path program 1 times [2020-10-20 03:05:37,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:37,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107453311] [2020-10-20 03:05:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:37,406 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:05:37,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107453311] [2020-10-20 03:05:37,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:37,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:05:37,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915872714] [2020-10-20 03:05:37,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:05:37,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:37,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:05:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:05:37,408 INFO L87 Difference]: Start difference. First operand 444 states and 1309 transitions. Second operand 3 states. [2020-10-20 03:05:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:37,432 INFO L93 Difference]: Finished difference Result 635 states and 1812 transitions. [2020-10-20 03:05:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:05:37,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-20 03:05:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:37,437 INFO L225 Difference]: With dead ends: 635 [2020-10-20 03:05:37,437 INFO L226 Difference]: Without dead ends: 458 [2020-10-20 03:05:37,438 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:05:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-20 03:05:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 434. [2020-10-20 03:05:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-20 03:05:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1219 transitions. [2020-10-20 03:05:37,454 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1219 transitions. Word has length 13 [2020-10-20 03:05:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:37,454 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1219 transitions. [2020-10-20 03:05:37,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:05:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1219 transitions. [2020-10-20 03:05:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:05:37,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:37,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:37,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:05:37,456 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:37,456 INFO L82 PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times [2020-10-20 03:05:37,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:37,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511088309] [2020-10-20 03:05:37,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:37,638 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:05:37,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511088309] [2020-10-20 03:05:37,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:37,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:05:37,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119299740] [2020-10-20 03:05:37,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:05:37,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:05:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:05:37,641 INFO L87 Difference]: Start difference. First operand 434 states and 1219 transitions. Second operand 7 states. [2020-10-20 03:05:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:37,784 INFO L93 Difference]: Finished difference Result 496 states and 1372 transitions. [2020-10-20 03:05:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:05:37,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-20 03:05:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:37,788 INFO L225 Difference]: With dead ends: 496 [2020-10-20 03:05:37,788 INFO L226 Difference]: Without dead ends: 460 [2020-10-20 03:05:37,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:05:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-20 03:05:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 424. [2020-10-20 03:05:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-20 03:05:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1171 transitions. [2020-10-20 03:05:37,805 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1171 transitions. Word has length 14 [2020-10-20 03:05:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:37,806 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1171 transitions. [2020-10-20 03:05:37,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:05:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1171 transitions. [2020-10-20 03:05:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:05:37,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:37,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:37,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:05:37,808 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:37,808 INFO L82 PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times [2020-10-20 03:05:37,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:37,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315939870] [2020-10-20 03:05:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:37,944 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:05:37,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315939870] [2020-10-20 03:05:37,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:37,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:05:37,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005917587] [2020-10-20 03:05:37,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:05:37,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:05:37,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:05:37,947 INFO L87 Difference]: Start difference. First operand 424 states and 1171 transitions. Second operand 7 states. [2020-10-20 03:05:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:38,140 INFO L93 Difference]: Finished difference Result 540 states and 1435 transitions. [2020-10-20 03:05:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:05:38,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-20 03:05:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:38,146 INFO L225 Difference]: With dead ends: 540 [2020-10-20 03:05:38,146 INFO L226 Difference]: Without dead ends: 448 [2020-10-20 03:05:38,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:05:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-20 03:05:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 418. [2020-10-20 03:05:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-20 03:05:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1132 transitions. [2020-10-20 03:05:38,162 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1132 transitions. Word has length 14 [2020-10-20 03:05:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:38,163 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1132 transitions. [2020-10-20 03:05:38,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:05:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1132 transitions. [2020-10-20 03:05:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:05:38,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:38,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:38,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:05:38,165 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1132759919, now seen corresponding path program 1 times [2020-10-20 03:05:38,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:38,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213232509] [2020-10-20 03:05:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:38,210 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:05:38,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213232509] [2020-10-20 03:05:38,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:38,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:05:38,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254081221] [2020-10-20 03:05:38,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:38,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:38,212 INFO L87 Difference]: Start difference. First operand 418 states and 1132 transitions. Second operand 4 states. [2020-10-20 03:05:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:38,241 INFO L93 Difference]: Finished difference Result 670 states and 1801 transitions. [2020-10-20 03:05:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:05:38,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 03:05:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:38,245 INFO L225 Difference]: With dead ends: 670 [2020-10-20 03:05:38,246 INFO L226 Difference]: Without dead ends: 376 [2020-10-20 03:05:38,246 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:05:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-10-20 03:05:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2020-10-20 03:05:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-10-20 03:05:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 999 transitions. [2020-10-20 03:05:38,276 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 999 transitions. Word has length 14 [2020-10-20 03:05:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:38,276 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 999 transitions. [2020-10-20 03:05:38,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 999 transitions. [2020-10-20 03:05:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:05:38,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:38,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:38,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:05:38,279 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 2 times [2020-10-20 03:05:38,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:38,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085340756] [2020-10-20 03:05:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:38,342 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:05:38,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085340756] [2020-10-20 03:05:38,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:38,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:05:38,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693868129] [2020-10-20 03:05:38,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:05:38,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:38,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:05:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:05:38,345 INFO L87 Difference]: Start difference. First operand 376 states and 999 transitions. Second operand 4 states. [2020-10-20 03:05:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:38,376 INFO L93 Difference]: Finished difference Result 382 states and 899 transitions. [2020-10-20 03:05:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:05:38,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 03:05:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:38,380 INFO L225 Difference]: With dead ends: 382 [2020-10-20 03:05:38,380 INFO L226 Difference]: Without dead ends: 282 [2020-10-20 03:05:38,381 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:05:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-20 03:05:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-10-20 03:05:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-20 03:05:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 653 transitions. [2020-10-20 03:05:38,390 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 653 transitions. Word has length 14 [2020-10-20 03:05:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:38,391 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 653 transitions. [2020-10-20 03:05:38,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:05:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 653 transitions. [2020-10-20 03:05:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:05:38,392 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:38,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:38,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:05:38,393 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1637663200, now seen corresponding path program 1 times [2020-10-20 03:05:38,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:38,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127992103] [2020-10-20 03:05:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:38,468 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:05:38,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127992103] [2020-10-20 03:05:38,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:38,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:05:38,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104803041] [2020-10-20 03:05:38,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:05:38,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:38,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:05:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:05:38,471 INFO L87 Difference]: Start difference. First operand 282 states and 653 transitions. Second operand 5 states. [2020-10-20 03:05:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:38,514 INFO L93 Difference]: Finished difference Result 240 states and 501 transitions. [2020-10-20 03:05:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:05:38,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-20 03:05:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:38,517 INFO L225 Difference]: With dead ends: 240 [2020-10-20 03:05:38,517 INFO L226 Difference]: Without dead ends: 183 [2020-10-20 03:05:38,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-20 03:05:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-10-20 03:05:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-20 03:05:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 370 transitions. [2020-10-20 03:05:38,523 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 370 transitions. Word has length 15 [2020-10-20 03:05:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:38,524 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 370 transitions. [2020-10-20 03:05:38,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:05:38,524 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 370 transitions. [2020-10-20 03:05:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:05:38,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:38,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:38,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:05:38,526 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:38,526 INFO L82 PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times [2020-10-20 03:05:38,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:38,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682704645] [2020-10-20 03:05:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:38,686 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:05:38,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682704645] [2020-10-20 03:05:38,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:38,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:05:38,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629319357] [2020-10-20 03:05:38,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:05:38,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:05:38,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:05:38,688 INFO L87 Difference]: Start difference. First operand 183 states and 370 transitions. Second operand 7 states. [2020-10-20 03:05:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:38,804 INFO L93 Difference]: Finished difference Result 210 states and 406 transitions. [2020-10-20 03:05:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:05:38,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-20 03:05:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:38,806 INFO L225 Difference]: With dead ends: 210 [2020-10-20 03:05:38,807 INFO L226 Difference]: Without dead ends: 157 [2020-10-20 03:05:38,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:05:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-20 03:05:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2020-10-20 03:05:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-20 03:05:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 285 transitions. [2020-10-20 03:05:38,815 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 285 transitions. Word has length 17 [2020-10-20 03:05:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:38,816 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 285 transitions. [2020-10-20 03:05:38,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:05:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 285 transitions. [2020-10-20 03:05:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:05:38,817 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:38,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:38,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 03:05:38,817 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times [2020-10-20 03:05:38,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:38,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876306828] [2020-10-20 03:05:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:05:38,944 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:05:38,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876306828] [2020-10-20 03:05:38,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:05:38,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:05:38,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390569075] [2020-10-20 03:05:38,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:05:38,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:05:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:05:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:05:38,946 INFO L87 Difference]: Start difference. First operand 146 states and 285 transitions. Second operand 6 states. [2020-10-20 03:05:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:05:38,996 INFO L93 Difference]: Finished difference Result 129 states and 252 transitions. [2020-10-20 03:05:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:05:38,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-20 03:05:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:05:38,998 INFO L225 Difference]: With dead ends: 129 [2020-10-20 03:05:38,998 INFO L226 Difference]: Without dead ends: 69 [2020-10-20 03:05:38,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:05:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-20 03:05:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-20 03:05:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 03:05:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 128 transitions. [2020-10-20 03:05:39,002 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 128 transitions. Word has length 17 [2020-10-20 03:05:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:05:39,002 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 128 transitions. [2020-10-20 03:05:39,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:05:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 128 transitions. [2020-10-20 03:05:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:05:39,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:05:39,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:05:39,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 03:05:39,004 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:05:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:05:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times [2020-10-20 03:05:39,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:05:39,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610960506] [2020-10-20 03:05:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:05:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:05:39,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:05:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:05:39,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:05:39,107 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:05:39,107 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:05:39,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 03:05:39,109 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 03:05:39,120 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-1690771125 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-1690771125 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1690771125 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1690771125 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1690771125| ULTIMATE.start_assume_abort_if_not_~cond_Out-1690771125) (= ~y$r_buff0_thd0~0_Out-1690771125 ~y$r_buff0_thd0~0_In-1690771125) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1690771125 0)) (or (and (= ~y$w_buff0_used~0_In-1690771125 ~y$w_buff0_used~0_Out-1690771125) .cse0) (and .cse1 .cse2 (= ~y$w_buff0_used~0_Out-1690771125 0))) (or (and (= ~y$w_buff1_used~0_In-1690771125 ~y$w_buff1_used~0_Out-1690771125) .cse3) (and .cse4 .cse5 (= 0 ~y$w_buff1_used~0_Out-1690771125))) (or (and (or (and .cse3 (= ~y~0_In-1690771125 ~y~0_Out-1690771125)) (and .cse4 .cse5 (= ~y$w_buff1~0_In-1690771125 ~y~0_Out-1690771125))) .cse0) (and .cse1 (= ~y$w_buff0~0_In-1690771125 ~y~0_Out-1690771125) .cse2)) (= ~y$r_buff1_thd0~0_In-1690771125 ~y$r_buff1_thd0~0_Out-1690771125)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1690771125|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690771125, ~y$w_buff1~0=~y$w_buff1~0_In-1690771125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1690771125, ~y$w_buff0~0=~y$w_buff0~0_In-1690771125, ~y~0=~y~0_In-1690771125, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1690771125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690771125} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1690771125, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1690771125|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1690771125|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1690771125|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1690771125|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1690771125|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1690771125|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1690771125|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1690771125, ~y$w_buff1~0=~y$w_buff1~0_In-1690771125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1690771125, ~y$w_buff0~0=~y$w_buff0~0_In-1690771125, ~y~0=~y~0_Out-1690771125, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1690771125, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1690771125} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-20 03:05:39,125 WARN 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:05:39,125 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-10-20 03:05:39,128 WARN 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:05:39,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,128 WARN 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:05:39,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,129 WARN 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:05:39,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,129 WARN 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:05:39,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,129 WARN 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:05:39,130 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,130 WARN 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:05:39,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,131 WARN 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:05:39,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,131 WARN 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:05:39,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,132 WARN 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:05:39,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,132 WARN 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:05:39,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,134 WARN 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:05:39,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,134 WARN 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:05:39,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,135 WARN 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:05:39,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,136 WARN 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:05:39,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,136 WARN 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:05:39,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,139 WARN 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:05:39,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,140 WARN 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:05:39,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,140 WARN 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:05:39,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,141 WARN 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:05:39,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,141 WARN 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:05:39,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,142 WARN 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:05:39,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,143 WARN 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:05:39,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,145 WARN 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:05:39,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,146 WARN 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:05:39,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,147 WARN 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:05:39,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,150 WARN 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:05:39,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,151 WARN 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:05:39,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,151 WARN 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:05:39,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:05:39 BasicIcfg [2020-10-20 03:05:39,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:05:39,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:05:39,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:05:39,208 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:05:39,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:05:24" (3/4) ... [2020-10-20 03:05:39,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:05:39,226 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-1690771125 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-1690771125 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1690771125 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1690771125 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1690771125| ULTIMATE.start_assume_abort_if_not_~cond_Out-1690771125) (= ~y$r_buff0_thd0~0_Out-1690771125 ~y$r_buff0_thd0~0_In-1690771125) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1690771125 0)) (or (and (= ~y$w_buff0_used~0_In-1690771125 ~y$w_buff0_used~0_Out-1690771125) .cse0) (and .cse1 .cse2 (= ~y$w_buff0_used~0_Out-1690771125 0))) (or (and (= ~y$w_buff1_used~0_In-1690771125 ~y$w_buff1_used~0_Out-1690771125) .cse3) (and .cse4 .cse5 (= 0 ~y$w_buff1_used~0_Out-1690771125))) (or (and (or (and .cse3 (= ~y~0_In-1690771125 ~y~0_Out-1690771125)) (and .cse4 .cse5 (= ~y$w_buff1~0_In-1690771125 ~y~0_Out-1690771125))) .cse0) (and .cse1 (= ~y$w_buff0~0_In-1690771125 ~y~0_Out-1690771125) .cse2)) (= ~y$r_buff1_thd0~0_In-1690771125 ~y$r_buff1_thd0~0_Out-1690771125)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1690771125|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690771125, ~y$w_buff1~0=~y$w_buff1~0_In-1690771125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1690771125, ~y$w_buff0~0=~y$w_buff0~0_In-1690771125, ~y~0=~y~0_In-1690771125, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1690771125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690771125} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1690771125, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1690771125|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1690771125|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1690771125|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1690771125|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1690771125|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1690771125|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1690771125|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1690771125, ~y$w_buff1~0=~y$w_buff1~0_In-1690771125, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1690771125, ~y$w_buff0~0=~y$w_buff0~0_In-1690771125, ~y~0=~y~0_Out-1690771125, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1690771125, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1690771125} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-20 03:05:39,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:05:39,228 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-10-20 03:05:39,228 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:05:39,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,229 WARN 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:05:39,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,229 WARN 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:05:39,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,230 WARN 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:05:39,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,230 WARN 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:05:39,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,230 WARN 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:05:39,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,231 WARN 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:05:39,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,231 WARN 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:05:39,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,232 WARN 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:05:39,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,232 WARN 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:05:39,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,232 WARN 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:05:39,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,233 WARN 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:05:39,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,233 WARN 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:05:39,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,234 WARN 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:05:39,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,234 WARN 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:05:39,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,235 WARN 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:05:39,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,235 WARN 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:05:39,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,235 WARN 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:05:39,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,236 WARN 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:05:39,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,236 WARN 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:05:39,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,237 WARN 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:05:39,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,237 WARN 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:05:39,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,237 WARN 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:05:39,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,238 WARN 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:05:39,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,238 WARN 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:05:39,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,238 WARN 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:05:39,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,239 WARN 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:05:39,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,239 WARN 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:05:39,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:05:39,386 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:05:39,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:05:39,388 INFO L168 Benchmark]: Toolchain (without parser) took 18215.48 ms. Allocated memory was 41.9 MB in the beginning and 145.2 MB in the end (delta: 103.3 MB). Free memory was 18.9 MB in the beginning and 50.7 MB in the end (delta: -31.8 MB). Peak memory consumption was 71.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,389 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 32.0 MB. Free memory was 9.0 MB in the beginning and 8.9 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.57 ms. Allocated memory was 41.9 MB in the beginning and 45.1 MB in the end (delta: 3.1 MB). Free memory was 18.0 MB in the beginning and 11.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.03 ms. Allocated memory was 45.1 MB in the beginning and 45.6 MB in the end (delta: 524.3 kB). Free memory was 11.4 MB in the beginning and 28.9 MB in the end (delta: -17.5 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,390 INFO L168 Benchmark]: Boogie Preprocessor took 45.64 ms. Allocated memory is still 45.6 MB. Free memory was 28.9 MB in the beginning and 26.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,390 INFO L168 Benchmark]: RCFGBuilder took 2358.06 ms. Allocated memory was 45.6 MB in the beginning and 65.0 MB in the end (delta: 19.4 MB). Free memory was 26.4 MB in the beginning and 28.7 MB in the end (delta: -2.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,391 INFO L168 Benchmark]: TraceAbstraction took 14811.54 ms. Allocated memory was 65.0 MB in the beginning and 145.2 MB in the end (delta: 80.2 MB). Free memory was 28.0 MB in the beginning and 67.7 MB in the end (delta: -39.7 MB). Peak memory consumption was 40.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,391 INFO L168 Benchmark]: Witness Printer took 179.07 ms. Allocated memory is still 145.2 MB. Free memory was 67.7 MB in the beginning and 50.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:05:39,395 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.21 ms. Allocated memory is still 32.0 MB. Free memory was 9.0 MB in the beginning and 8.9 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 730.57 ms. Allocated memory was 41.9 MB in the beginning and 45.1 MB in the end (delta: 3.1 MB). Free memory was 18.0 MB in the beginning and 11.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 79.03 ms. Allocated memory was 45.1 MB in the beginning and 45.6 MB in the end (delta: 524.3 kB). Free memory was 11.4 MB in the beginning and 28.9 MB in the end (delta: -17.5 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 45.64 ms. Allocated memory is still 45.6 MB. Free memory was 28.9 MB in the beginning and 26.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2358.06 ms. Allocated memory was 45.6 MB in the beginning and 65.0 MB in the end (delta: 19.4 MB). Free memory was 26.4 MB in the beginning and 28.7 MB in the end (delta: -2.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.3 GB. * TraceAbstraction took 14811.54 ms. Allocated memory was 65.0 MB in the beginning and 145.2 MB in the end (delta: 80.2 MB). Free memory was 28.0 MB in the beginning and 67.7 MB in the end (delta: -39.7 MB). Peak memory consumption was 40.5 MB. Max. memory is 14.3 GB. * Witness Printer took 179.07 ms. Allocated memory is still 145.2 MB. Free memory was 67.7 MB in the beginning and 50.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1170 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.0s, 103 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.9s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4794 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2186; [L814] FCALL, FORK 0 pthread_create(&t2186, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2187; [L816] FCALL, FORK 0 pthread_create(&t2187, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2188; [L818] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe017_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 326 SDtfs, 362 SDslu, 543 SDs, 0 SdLazy, 369 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 117 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 23811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...