/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:31:53,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:31:53,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:31:53,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:31:53,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:31:53,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:31:53,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:31:53,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:31:53,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:31:53,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:31:53,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:31:53,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:31:53,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:31:53,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:31:53,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:31:53,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:31:53,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:31:53,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:31:53,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:31:53,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:31:53,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:31:53,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:31:53,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:31:53,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:31:53,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:31:53,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:31:53,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:31:53,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:31:53,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:31:53,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:31:53,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:31:53,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:31:53,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:31:53,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:31:53,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:31:53,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:31:53,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:31:53,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:31:53,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:31:53,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:31:53,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:31:53,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:31:53,905 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:31:53,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:31:53,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:31:53,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:31:53,906 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:31:53,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:31:53,907 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:31:53,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:31:53,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:31:53,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:31:53,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:31:53,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:31:53,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:31:53,908 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:31:53,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:31:53,908 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:31:53,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:31:53,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:31:53,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:31:53,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:31:53,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:31:53,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:31:53,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:31:53,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:31:53,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:31:53,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:31:53,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:31:53,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:31:53,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:31:54,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:31:54,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:31:54,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:31:54,220 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:31:54,220 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:31:54,221 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.oepc.i [2020-10-16 01:31:54,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a23c974/070f1250c33c4db796a082990f4c77c3/FLAG6e25112d9 [2020-10-16 01:31:54,844 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:31:54,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.oepc.i [2020-10-16 01:31:54,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a23c974/070f1250c33c4db796a082990f4c77c3/FLAG6e25112d9 [2020-10-16 01:31:55,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a23c974/070f1250c33c4db796a082990f4c77c3 [2020-10-16 01:31:55,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:31:55,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:31:55,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:55,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:31:55,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:31:55,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce47858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55, skipping insertion in model container [2020-10-16 01:31:55,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:31:55,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:31:55,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:55,689 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:31:55,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:55,819 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:31:55,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55 WrapperNode [2020-10-16 01:31:55,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:55,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:55,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:31:55,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:31:55,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:55,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:31:55,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:31:55,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:31:55,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (1/1) ... [2020-10-16 01:31:55,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:31:55,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:31:55,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:31:55,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:31:55,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (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-16 01:31:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:31:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:31:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:31:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:31:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:31:56,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:31:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:31:56,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:31:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:31:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:31:56,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:31:56,024 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:31:59,110 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:31:59,111 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:31:59,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:59 BoogieIcfgContainer [2020-10-16 01:31:59,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:31:59,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:31:59,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:31:59,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:31:59,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:31:55" (1/3) ... [2020-10-16 01:31:59,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176627a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:59, skipping insertion in model container [2020-10-16 01:31:59,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:55" (2/3) ... [2020-10-16 01:31:59,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176627a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:59, skipping insertion in model container [2020-10-16 01:31:59,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:59" (3/3) ... [2020-10-16 01:31:59,122 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.oepc.i [2020-10-16 01:31:59,138 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:31:59,148 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:31:59,150 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:31:59,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,193 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,193 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,194 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,194 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,235 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,250 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,250 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,251 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:59,276 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:31:59,306 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:31:59,306 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:31:59,306 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:31:59,307 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:31:59,307 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:31:59,307 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:31:59,307 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:31:59,308 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:31:59,322 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 01:31:59,364 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 01:31:59,365 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:59,370 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:31:59,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 01:31:59,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:59,381 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:31:59,384 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:59,387 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:59,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 81 places, 76 transitions, 158 flow [2020-10-16 01:31:59,409 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 01:31:59,410 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:59,410 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:31:59,413 INFO L117 LiptonReduction]: Number of co-enabled transitions 1024 [2020-10-16 01:31:59,832 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:32:00,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:00,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:00,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:00,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:00,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:00,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,371 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-16 01:32:00,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:00,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:00,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:00,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:00,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:00,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:00,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:00,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:00,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:00,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:00,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:00,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:01,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:01,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:01,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:01,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:01,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:01,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:01,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:32:01,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:01,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:01,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:01,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:01,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:01,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:01,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:01,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:02,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:02,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:02,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:02,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:02,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:02,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:02,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:02,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:02,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:02,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:02,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:32:02,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:02,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:32:02,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:02,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:02,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:02,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:02,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:02,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:32:02,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:02,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:32:02,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:32:02,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:02,859 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:32:02,996 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:32:03,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:03,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:03,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:03,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:03,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:03,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:03,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:32:03,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:03,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:03,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:03,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:03,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:03,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 01:32:03,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:03,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:03,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:03,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:03,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:03,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:03,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:03,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:03,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:03,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:03,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:32:03,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:03,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:32:03,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:04,153 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2020-10-16 01:32:04,415 INFO L132 LiptonReduction]: Checked pairs total: 3075 [2020-10-16 01:32:04,416 INFO L134 LiptonReduction]: Total number of compositions: 65 [2020-10-16 01:32:04,418 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5041 [2020-10-16 01:32:04,424 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2020-10-16 01:32:04,424 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:04,425 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:04,426 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:32:04,426 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1548002, now seen corresponding path program 1 times [2020-10-16 01:32:04,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:04,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599896791] [2020-10-16 01:32:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:04,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599896791] [2020-10-16 01:32:04,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:04,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:04,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365899515] [2020-10-16 01:32:04,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:04,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:04,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:04,691 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 143 [2020-10-16 01:32:04,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states. [2020-10-16 01:32:04,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:04,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 143 [2020-10-16 01:32:04,697 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:04,848 INFO L129 PetriNetUnfolder]: 40/107 cut-off events. [2020-10-16 01:32:04,848 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:04,849 INFO L80 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 107 events. 40/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 413 event pairs, 29 based on Foata normal form. 12/110 useless extension candidates. Maximal degree in co-relation 182. Up to 59 conditions per place. [2020-10-16 01:32:04,852 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 11 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 01:32:04,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 80 flow [2020-10-16 01:32:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2020-10-16 01:32:04,868 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8344988344988346 [2020-10-16 01:32:04,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2020-10-16 01:32:04,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2020-10-16 01:32:04,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:04,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2020-10-16 01:32:04,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:04,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:04,885 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:04,887 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 358 transitions. [2020-10-16 01:32:04,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 80 flow [2020-10-16 01:32:04,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:04,892 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2020-10-16 01:32:04,895 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2020-10-16 01:32:04,896 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 01:32:04,896 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2020-10-16 01:32:04,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:04,896 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:04,896 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:04,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:32:04,897 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:04,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:04,897 INFO L82 PathProgramCache]: Analyzing trace with hash 644582209, now seen corresponding path program 1 times [2020-10-16 01:32:04,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:04,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86812882] [2020-10-16 01:32:04,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:05,123 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-16 01:32:05,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86812882] [2020-10-16 01:32:05,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:05,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:05,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813808858] [2020-10-16 01:32:05,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:05,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:05,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:05,128 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 143 [2020-10-16 01:32:05,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand 4 states. [2020-10-16 01:32:05,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:05,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 143 [2020-10-16 01:32:05,129 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:05,187 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2020-10-16 01:32:05,187 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:05,187 INFO L80 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 40. Up to 5 conditions per place. [2020-10-16 01:32:05,188 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 2 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2020-10-16 01:32:05,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 72 flow [2020-10-16 01:32:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2020-10-16 01:32:05,192 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7916083916083916 [2020-10-16 01:32:05,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2020-10-16 01:32:05,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2020-10-16 01:32:05,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:05,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2020-10-16 01:32:05,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:05,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:05,197 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:05,198 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 5 states and 566 transitions. [2020-10-16 01:32:05,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 72 flow [2020-10-16 01:32:05,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:05,199 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 52 flow [2020-10-16 01:32:05,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2020-10-16 01:32:05,200 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 01:32:05,200 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 52 flow [2020-10-16 01:32:05,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:05,200 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:05,200 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:05,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:32:05,201 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash -19193152, now seen corresponding path program 1 times [2020-10-16 01:32:05,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:05,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303168134] [2020-10-16 01:32:05,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:05,414 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-16 01:32:05,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303168134] [2020-10-16 01:32:05,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:05,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:05,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505279704] [2020-10-16 01:32:05,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:05,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:05,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:05,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:05,417 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 143 [2020-10-16 01:32:05,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 52 flow. Second operand 6 states. [2020-10-16 01:32:05,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:05,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 143 [2020-10-16 01:32:05,418 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:05,696 INFO L129 PetriNetUnfolder]: 63/149 cut-off events. [2020-10-16 01:32:05,697 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2020-10-16 01:32:05,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 149 events. 63/149 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 592 event pairs, 32 based on Foata normal form. 10/157 useless extension candidates. Maximal degree in co-relation 312. Up to 81 conditions per place. [2020-10-16 01:32:05,699 INFO L132 encePairwiseOnDemand]: 134/143 looper letters, 15 selfloop transitions, 9 changer transitions 12/44 dead transitions. [2020-10-16 01:32:05,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 192 flow [2020-10-16 01:32:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:32:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:32:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions. [2020-10-16 01:32:05,703 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6674436674436675 [2020-10-16 01:32:05,703 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 859 transitions. [2020-10-16 01:32:05,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions. [2020-10-16 01:32:05,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:05,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions. [2020-10-16 01:32:05,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:32:05,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:32:05,708 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:32:05,708 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 52 flow. Second operand 9 states and 859 transitions. [2020-10-16 01:32:05,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 192 flow [2020-10-16 01:32:05,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 176 flow, removed 4 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:05,711 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 115 flow [2020-10-16 01:32:05,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2020-10-16 01:32:05,711 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2020-10-16 01:32:05,711 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 115 flow [2020-10-16 01:32:05,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:05,711 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:05,711 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:05,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:32:05,712 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2051569577, now seen corresponding path program 1 times [2020-10-16 01:32:05,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:05,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153379155] [2020-10-16 01:32:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:05,820 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-16 01:32:05,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153379155] [2020-10-16 01:32:05,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:05,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:05,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237983420] [2020-10-16 01:32:05,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:05,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:05,823 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 143 [2020-10-16 01:32:05,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 115 flow. Second operand 4 states. [2020-10-16 01:32:05,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:05,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 143 [2020-10-16 01:32:05,823 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:05,882 INFO L129 PetriNetUnfolder]: 13/61 cut-off events. [2020-10-16 01:32:05,883 INFO L130 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2020-10-16 01:32:05,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 61 events. 13/61 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 6 based on Foata normal form. 4/64 useless extension candidates. Maximal degree in co-relation 166. Up to 28 conditions per place. [2020-10-16 01:32:05,884 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 2 selfloop transitions, 3 changer transitions 2/27 dead transitions. [2020-10-16 01:32:05,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 143 flow [2020-10-16 01:32:05,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2020-10-16 01:32:05,886 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7874125874125875 [2020-10-16 01:32:05,886 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2020-10-16 01:32:05,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2020-10-16 01:32:05,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:05,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2020-10-16 01:32:05,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:05,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:05,890 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:05,890 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 115 flow. Second operand 5 states and 563 transitions. [2020-10-16 01:32:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 143 flow [2020-10-16 01:32:05,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 137 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:05,893 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 124 flow [2020-10-16 01:32:05,893 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2020-10-16 01:32:05,893 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2020-10-16 01:32:05,893 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 124 flow [2020-10-16 01:32:05,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:05,894 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:05,894 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:05,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:32:05,894 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 414536339, now seen corresponding path program 1 times [2020-10-16 01:32:05,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:05,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621173470] [2020-10-16 01:32:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:06,246 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-16 01:32:06,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621173470] [2020-10-16 01:32:06,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:06,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:06,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594943842] [2020-10-16 01:32:06,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:06,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:06,253 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 143 [2020-10-16 01:32:06,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 124 flow. Second operand 7 states. [2020-10-16 01:32:06,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:06,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 143 [2020-10-16 01:32:06,254 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:06,532 INFO L129 PetriNetUnfolder]: 48/125 cut-off events. [2020-10-16 01:32:06,533 INFO L130 PetriNetUnfolder]: For 128/130 co-relation queries the response was YES. [2020-10-16 01:32:06,533 INFO L80 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 125 events. 48/125 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 474 event pairs, 0 based on Foata normal form. 6/131 useless extension candidates. Maximal degree in co-relation 400. Up to 47 conditions per place. [2020-10-16 01:32:06,534 INFO L132 encePairwiseOnDemand]: 136/143 looper letters, 22 selfloop transitions, 11 changer transitions 4/45 dead transitions. [2020-10-16 01:32:06,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 313 flow [2020-10-16 01:32:06,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 707 transitions. [2020-10-16 01:32:06,537 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.618006993006993 [2020-10-16 01:32:06,538 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 707 transitions. [2020-10-16 01:32:06,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 707 transitions. [2020-10-16 01:32:06,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:06,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 707 transitions. [2020-10-16 01:32:06,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:06,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:06,542 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:06,542 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 124 flow. Second operand 8 states and 707 transitions. [2020-10-16 01:32:06,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 313 flow [2020-10-16 01:32:06,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 278 flow, removed 10 selfloop flow, removed 5 redundant places. [2020-10-16 01:32:06,546 INFO L241 Difference]: Finished difference. Result has 43 places, 29 transitions, 175 flow [2020-10-16 01:32:06,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2020-10-16 01:32:06,546 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2020-10-16 01:32:06,546 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 175 flow [2020-10-16 01:32:06,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:06,547 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:06,547 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:06,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:32:06,547 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1264164671, now seen corresponding path program 1 times [2020-10-16 01:32:06,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:06,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123145475] [2020-10-16 01:32:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:06,899 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-16 01:32:06,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123145475] [2020-10-16 01:32:06,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:06,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:06,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079107190] [2020-10-16 01:32:06,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:06,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:06,903 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 143 [2020-10-16 01:32:06,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 175 flow. Second operand 9 states. [2020-10-16 01:32:06,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:06,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 143 [2020-10-16 01:32:06,904 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:07,257 INFO L129 PetriNetUnfolder]: 51/131 cut-off events. [2020-10-16 01:32:07,257 INFO L130 PetriNetUnfolder]: For 309/318 co-relation queries the response was YES. [2020-10-16 01:32:07,259 INFO L80 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 131 events. 51/131 cut-off events. For 309/318 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 489 event pairs, 14 based on Foata normal form. 7/137 useless extension candidates. Maximal degree in co-relation 502. Up to 83 conditions per place. [2020-10-16 01:32:07,260 INFO L132 encePairwiseOnDemand]: 136/143 looper letters, 23 selfloop transitions, 14 changer transitions 5/50 dead transitions. [2020-10-16 01:32:07,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 414 flow [2020-10-16 01:32:07,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 713 transitions. [2020-10-16 01:32:07,265 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6232517482517482 [2020-10-16 01:32:07,265 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 713 transitions. [2020-10-16 01:32:07,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 713 transitions. [2020-10-16 01:32:07,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:07,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 713 transitions. [2020-10-16 01:32:07,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:07,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:07,270 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:07,270 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 175 flow. Second operand 8 states and 713 transitions. [2020-10-16 01:32:07,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 414 flow [2020-10-16 01:32:07,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 395 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:07,275 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 285 flow [2020-10-16 01:32:07,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=285, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2020-10-16 01:32:07,276 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2020-10-16 01:32:07,276 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 285 flow [2020-10-16 01:32:07,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:07,276 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:07,276 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:07,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:32:07,277 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash 323660383, now seen corresponding path program 2 times [2020-10-16 01:32:07,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:07,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37043648] [2020-10-16 01:32:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:07,602 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-16 01:32:07,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37043648] [2020-10-16 01:32:07,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:07,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:07,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395067987] [2020-10-16 01:32:07,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:07,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:07,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:07,606 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 143 [2020-10-16 01:32:07,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 285 flow. Second operand 8 states. [2020-10-16 01:32:07,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:07,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 143 [2020-10-16 01:32:07,607 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:07,852 INFO L129 PetriNetUnfolder]: 50/132 cut-off events. [2020-10-16 01:32:07,853 INFO L130 PetriNetUnfolder]: For 387/399 co-relation queries the response was YES. [2020-10-16 01:32:07,853 INFO L80 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 132 events. 50/132 cut-off events. For 387/399 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 520 event pairs, 5 based on Foata normal form. 12/144 useless extension candidates. Maximal degree in co-relation 538. Up to 60 conditions per place. [2020-10-16 01:32:07,855 INFO L132 encePairwiseOnDemand]: 134/143 looper letters, 18 selfloop transitions, 18 changer transitions 4/48 dead transitions. [2020-10-16 01:32:07,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 447 flow [2020-10-16 01:32:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2020-10-16 01:32:07,858 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6206293706293706 [2020-10-16 01:32:07,858 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 710 transitions. [2020-10-16 01:32:07,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 710 transitions. [2020-10-16 01:32:07,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:07,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 710 transitions. [2020-10-16 01:32:07,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:07,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:07,863 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:07,863 INFO L185 Difference]: Start difference. First operand has 51 places, 38 transitions, 285 flow. Second operand 8 states and 710 transitions. [2020-10-16 01:32:07,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 447 flow [2020-10-16 01:32:07,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 437 flow, removed 5 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:07,868 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 368 flow [2020-10-16 01:32:07,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=368, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2020-10-16 01:32:07,869 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 30 predicate places. [2020-10-16 01:32:07,869 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 368 flow [2020-10-16 01:32:07,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:07,869 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:07,869 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:07,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:32:07,869 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:07,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1306921158, now seen corresponding path program 1 times [2020-10-16 01:32:07,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:07,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273197408] [2020-10-16 01:32:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:08,204 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-16 01:32:08,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273197408] [2020-10-16 01:32:08,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:08,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:08,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312962596] [2020-10-16 01:32:08,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:08,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:08,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:08,208 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 143 [2020-10-16 01:32:08,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 368 flow. Second operand 9 states. [2020-10-16 01:32:08,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:08,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 143 [2020-10-16 01:32:08,209 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:08,485 INFO L129 PetriNetUnfolder]: 47/125 cut-off events. [2020-10-16 01:32:08,485 INFO L130 PetriNetUnfolder]: For 575/587 co-relation queries the response was YES. [2020-10-16 01:32:08,486 INFO L80 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 125 events. 47/125 cut-off events. For 575/587 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 475 event pairs, 12 based on Foata normal form. 11/136 useless extension candidates. Maximal degree in co-relation 593. Up to 40 conditions per place. [2020-10-16 01:32:08,487 INFO L132 encePairwiseOnDemand]: 137/143 looper letters, 21 selfloop transitions, 16 changer transitions 2/47 dead transitions. [2020-10-16 01:32:08,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 501 flow [2020-10-16 01:32:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 614 transitions. [2020-10-16 01:32:08,491 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6133866133866134 [2020-10-16 01:32:08,491 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 614 transitions. [2020-10-16 01:32:08,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 614 transitions. [2020-10-16 01:32:08,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:08,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 614 transitions. [2020-10-16 01:32:08,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:08,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:08,496 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:08,496 INFO L185 Difference]: Start difference. First operand has 57 places, 41 transitions, 368 flow. Second operand 7 states and 614 transitions. [2020-10-16 01:32:08,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 501 flow [2020-10-16 01:32:08,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 443 flow, removed 13 selfloop flow, removed 8 redundant places. [2020-10-16 01:32:08,501 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 369 flow [2020-10-16 01:32:08,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2020-10-16 01:32:08,501 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2020-10-16 01:32:08,502 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 369 flow [2020-10-16 01:32:08,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:08,502 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:08,502 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:08,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:32:08,502 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1033348852, now seen corresponding path program 1 times [2020-10-16 01:32:08,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:08,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164845815] [2020-10-16 01:32:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:08,745 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-16 01:32:08,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164845815] [2020-10-16 01:32:08,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:08,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:08,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277864480] [2020-10-16 01:32:08,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:08,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:08,752 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 143 [2020-10-16 01:32:08,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 369 flow. Second operand 9 states. [2020-10-16 01:32:08,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:08,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 143 [2020-10-16 01:32:08,753 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:09,071 INFO L129 PetriNetUnfolder]: 51/148 cut-off events. [2020-10-16 01:32:09,071 INFO L130 PetriNetUnfolder]: For 737/749 co-relation queries the response was YES. [2020-10-16 01:32:09,072 INFO L80 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 148 events. 51/148 cut-off events. For 737/749 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 665 event pairs, 6 based on Foata normal form. 13/161 useless extension candidates. Maximal degree in co-relation 667. Up to 45 conditions per place. [2020-10-16 01:32:09,073 INFO L132 encePairwiseOnDemand]: 136/143 looper letters, 18 selfloop transitions, 15 changer transitions 12/53 dead transitions. [2020-10-16 01:32:09,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 540 flow [2020-10-16 01:32:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 685 transitions. [2020-10-16 01:32:09,076 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5987762237762237 [2020-10-16 01:32:09,077 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 685 transitions. [2020-10-16 01:32:09,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 685 transitions. [2020-10-16 01:32:09,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:09,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 685 transitions. [2020-10-16 01:32:09,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:09,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:09,081 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:09,081 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 369 flow. Second operand 8 states and 685 transitions. [2020-10-16 01:32:09,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 540 flow [2020-10-16 01:32:09,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 498 flow, removed 5 selfloop flow, removed 7 redundant places. [2020-10-16 01:32:09,085 INFO L241 Difference]: Finished difference. Result has 58 places, 39 transitions, 373 flow [2020-10-16 01:32:09,086 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=373, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2020-10-16 01:32:09,086 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2020-10-16 01:32:09,086 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 373 flow [2020-10-16 01:32:09,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:09,086 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:09,086 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:09,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:32:09,087 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1778435856, now seen corresponding path program 2 times [2020-10-16 01:32:09,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:09,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378452304] [2020-10-16 01:32:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:09,168 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-16 01:32:09,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378452304] [2020-10-16 01:32:09,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:09,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:09,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938398388] [2020-10-16 01:32:09,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:09,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:09,171 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 143 [2020-10-16 01:32:09,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 373 flow. Second operand 4 states. [2020-10-16 01:32:09,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:09,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 143 [2020-10-16 01:32:09,172 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:09,226 INFO L129 PetriNetUnfolder]: 26/111 cut-off events. [2020-10-16 01:32:09,227 INFO L130 PetriNetUnfolder]: For 653/656 co-relation queries the response was YES. [2020-10-16 01:32:09,227 INFO L80 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 111 events. 26/111 cut-off events. For 653/656 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 523 event pairs, 1 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 486. Up to 39 conditions per place. [2020-10-16 01:32:09,228 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 4 selfloop transitions, 2 changer transitions 20/41 dead transitions. [2020-10-16 01:32:09,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 41 transitions, 409 flow [2020-10-16 01:32:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:32:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:32:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2020-10-16 01:32:09,231 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7972027972027972 [2020-10-16 01:32:09,231 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2020-10-16 01:32:09,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2020-10-16 01:32:09,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:09,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2020-10-16 01:32:09,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:32:09,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:32:09,234 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:32:09,234 INFO L185 Difference]: Start difference. First operand has 58 places, 39 transitions, 373 flow. Second operand 4 states and 456 transitions. [2020-10-16 01:32:09,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 41 transitions, 409 flow [2020-10-16 01:32:09,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 339 flow, removed 8 selfloop flow, removed 10 redundant places. [2020-10-16 01:32:09,238 INFO L241 Difference]: Finished difference. Result has 51 places, 21 transitions, 124 flow [2020-10-16 01:32:09,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=21} [2020-10-16 01:32:09,239 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2020-10-16 01:32:09,239 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 21 transitions, 124 flow [2020-10-16 01:32:09,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:09,239 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:09,239 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:09,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:32:09,239 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash 490482162, now seen corresponding path program 3 times [2020-10-16 01:32:09,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:09,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487543255] [2020-10-16 01:32:09,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:09,335 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-16 01:32:09,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487543255] [2020-10-16 01:32:09,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:09,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:09,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294577880] [2020-10-16 01:32:09,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:09,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:09,338 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 143 [2020-10-16 01:32:09,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 21 transitions, 124 flow. Second operand 4 states. [2020-10-16 01:32:09,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:09,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 143 [2020-10-16 01:32:09,339 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:09,371 INFO L129 PetriNetUnfolder]: 12/62 cut-off events. [2020-10-16 01:32:09,371 INFO L130 PetriNetUnfolder]: For 138/141 co-relation queries the response was YES. [2020-10-16 01:32:09,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 62 events. 12/62 cut-off events. For 138/141 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 199 event pairs, 4 based on Foata normal form. 9/71 useless extension candidates. Maximal degree in co-relation 169. Up to 29 conditions per place. [2020-10-16 01:32:09,372 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 4 selfloop transitions, 3 changer transitions 6/26 dead transitions. [2020-10-16 01:32:09,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 26 transitions, 144 flow [2020-10-16 01:32:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2020-10-16 01:32:09,374 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8097902097902098 [2020-10-16 01:32:09,375 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2020-10-16 01:32:09,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2020-10-16 01:32:09,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:09,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2020-10-16 01:32:09,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:09,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:09,378 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:09,378 INFO L185 Difference]: Start difference. First operand has 51 places, 21 transitions, 124 flow. Second operand 5 states and 579 transitions. [2020-10-16 01:32:09,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 26 transitions, 144 flow [2020-10-16 01:32:09,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 105 flow, removed 9 selfloop flow, removed 14 redundant places. [2020-10-16 01:32:09,380 INFO L241 Difference]: Finished difference. Result has 38 places, 20 transitions, 90 flow [2020-10-16 01:32:09,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=20} [2020-10-16 01:32:09,380 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2020-10-16 01:32:09,380 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 90 flow [2020-10-16 01:32:09,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:09,381 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:09,381 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:09,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:32:09,381 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash -795047528, now seen corresponding path program 1 times [2020-10-16 01:32:09,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:09,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073528354] [2020-10-16 01:32:09,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:09,507 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-16 01:32:09,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073528354] [2020-10-16 01:32:09,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:09,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:09,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951462427] [2020-10-16 01:32:09,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:09,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:09,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:09,510 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 143 [2020-10-16 01:32:09,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 90 flow. Second operand 5 states. [2020-10-16 01:32:09,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:09,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 143 [2020-10-16 01:32:09,511 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:09,563 INFO L129 PetriNetUnfolder]: 2/24 cut-off events. [2020-10-16 01:32:09,563 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2020-10-16 01:32:09,563 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 24 events. 2/24 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 3/27 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2020-10-16 01:32:09,564 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 2 selfloop transitions, 5 changer transitions 3/23 dead transitions. [2020-10-16 01:32:09,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 23 transitions, 126 flow [2020-10-16 01:32:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2020-10-16 01:32:09,567 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8041958041958042 [2020-10-16 01:32:09,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2020-10-16 01:32:09,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2020-10-16 01:32:09,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:09,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2020-10-16 01:32:09,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:09,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:09,571 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:09,571 INFO L185 Difference]: Start difference. First operand has 38 places, 20 transitions, 90 flow. Second operand 6 states and 690 transitions. [2020-10-16 01:32:09,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 23 transitions, 126 flow [2020-10-16 01:32:09,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 23 transitions, 101 flow, removed 8 selfloop flow, removed 5 redundant places. [2020-10-16 01:32:09,573 INFO L241 Difference]: Finished difference. Result has 39 places, 20 transitions, 89 flow [2020-10-16 01:32:09,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2020-10-16 01:32:09,573 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2020-10-16 01:32:09,573 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 89 flow [2020-10-16 01:32:09,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:09,574 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:09,574 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:09,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:32:09,574 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash 763075396, now seen corresponding path program 1 times [2020-10-16 01:32:09,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:09,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687911324] [2020-10-16 01:32:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:09,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:09,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:09,807 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:32:09,807 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:32:09,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:32:09,833 WARN 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-16 01:32:09,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,843 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,843 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,844 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,846 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,853 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,854 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,854 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,854 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,858 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,859 WARN 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-16 01:32:09,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,859 WARN 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-16 01:32:09,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,859 WARN 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-16 01:32:09,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,859 WARN 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-16 01:32:09,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,860 WARN 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-16 01:32:09,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,860 WARN 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-16 01:32:09,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,861 WARN 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-16 01:32:09,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,861 WARN 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-16 01:32:09,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,862 WARN 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-16 01:32:09,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,862 WARN 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-16 01:32:09,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,863 WARN 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-16 01:32:09,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,863 WARN 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-16 01:32:09,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,872 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,872 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,872 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,872 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,872 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,873 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,873 WARN 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-16 01:32:09,873 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,873 WARN 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-16 01:32:09,874 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,874 WARN 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-16 01:32:09,874 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,874 WARN 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-16 01:32:09,875 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,875 WARN 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-16 01:32:09,875 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,875 WARN 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-16 01:32:09,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,876 WARN 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-16 01:32:09,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,876 WARN 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-16 01:32:09,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,877 WARN 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-16 01:32:09,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,877 WARN 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-16 01:32:09,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:32:09,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:09,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:32:09 BasicIcfg [2020-10-16 01:32:09,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:32:09,948 INFO L168 Benchmark]: Toolchain (without parser) took 14845.78 ms. Allocated memory was 250.1 MB in the beginning and 692.1 MB in the end (delta: 442.0 MB). Free memory was 204.3 MB in the beginning and 573.9 MB in the end (delta: -369.6 MB). Peak memory consumption was 72.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:09,949 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:32:09,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.94 ms. Allocated memory was 250.1 MB in the beginning and 309.9 MB in the end (delta: 59.8 MB). Free memory was 204.3 MB in the beginning and 255.7 MB in the end (delta: -51.4 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:09,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 309.9 MB. Free memory was 255.7 MB in the beginning and 250.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:09,951 INFO L168 Benchmark]: Boogie Preprocessor took 55.79 ms. Allocated memory is still 309.9 MB. Free memory was 250.6 MB in the beginning and 248.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:09,952 INFO L168 Benchmark]: RCFGBuilder took 3166.64 ms. Allocated memory was 309.9 MB in the beginning and 370.1 MB in the end (delta: 60.3 MB). Free memory was 248.1 MB in the beginning and 188.9 MB in the end (delta: 59.2 MB). Peak memory consumption was 142.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:09,952 INFO L168 Benchmark]: TraceAbstraction took 10831.52 ms. Allocated memory was 370.1 MB in the beginning and 692.1 MB in the end (delta: 321.9 MB). Free memory was 188.9 MB in the beginning and 573.9 MB in the end (delta: -385.0 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:32:09,956 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 716.94 ms. Allocated memory was 250.1 MB in the beginning and 309.9 MB in the end (delta: 59.8 MB). Free memory was 204.3 MB in the beginning and 255.7 MB in the end (delta: -51.4 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.30 ms. Allocated memory is still 309.9 MB. Free memory was 255.7 MB in the beginning and 250.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 55.79 ms. Allocated memory is still 309.9 MB. Free memory was 250.6 MB in the beginning and 248.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3166.64 ms. Allocated memory was 309.9 MB in the beginning and 370.1 MB in the end (delta: 60.3 MB). Free memory was 248.1 MB in the beginning and 188.9 MB in the end (delta: 59.2 MB). Peak memory consumption was 142.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10831.52 ms. Allocated memory was 370.1 MB in the beginning and 692.1 MB in the end (delta: 321.9 MB). Free memory was 188.9 MB in the beginning and 573.9 MB in the end (delta: -385.0 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 624 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 32 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 69 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.0s, 81 PlacesBefore, 27 PlacesAfterwards, 76 TransitionsBefore, 21 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3075 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L707] 0 int y = 0; [L708] 0 _Bool y$flush_delayed; [L709] 0 int y$mem_tmp; [L710] 0 _Bool y$r_buff0_thd0; [L711] 0 _Bool y$r_buff0_thd1; [L712] 0 _Bool y$r_buff0_thd2; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$read_delayed; [L717] 0 int *y$read_delayed_var; [L718] 0 int y$w_buff0; [L719] 0 _Bool y$w_buff0_used; [L720] 0 int y$w_buff1; [L721] 0 _Bool y$w_buff1_used; [L722] 0 _Bool weak$$choice0; [L723] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1589; [L816] FCALL, FORK 0 pthread_create(&t1589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L727] 1 y$w_buff1 = y$w_buff0 [L728] 1 y$w_buff0 = 2 [L729] 1 y$w_buff1_used = y$w_buff0_used [L730] 1 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 t1590; [L818] FCALL, FORK 0 pthread_create(&t1590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L755] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L758] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 y$flush_delayed = weak$$choice2 [L780] 2 y$mem_tmp = y [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L781] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L782] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L782] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L783] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L783] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L783] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L784] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L784] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L786] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L786] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L786] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L787] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = y [L789] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L789] 2 y = y$flush_delayed ? y$mem_tmp : y [L790] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] 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) [L741] 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) [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L743] 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 [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 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 [L793] 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) [L793] 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) [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 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 [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 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 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L748] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L750] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [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] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [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] 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] EXPR 0 !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] 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] 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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [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 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_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [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 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 3 procedures, 77 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 53 SDtfs, 34 SDslu, 67 SDs, 0 SdLazy, 504 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 15556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...