/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:58:00,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:58:00,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:58:00,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:58:00,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:58:00,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:58:00,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:58:00,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:58:00,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:58:00,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:58:00,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:58:00,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:58:00,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:58:00,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:58:00,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:58:00,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:58:00,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:58:00,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:58:00,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:58:00,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:58:00,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:58:00,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:58:00,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:58:00,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:58:00,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:58:00,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:58:00,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:58:00,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:58:00,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:58:00,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:58:00,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:58:00,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:58:00,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:58:00,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:58:00,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:58:00,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:58:00,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:58:00,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:58:00,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:58:00,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:58:00,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:58:00,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 21:58:00,887 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:58:00,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:58:00,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:58:00,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:58:00,890 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:58:00,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:58:00,891 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:58:00,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:58:00,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:58:00,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:58:00,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:58:00,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:58:00,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:58:00,894 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:58:00,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:58:00,894 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:58:00,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:58:00,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:58:00,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:58:00,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:58:00,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:58:00,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:58:00,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:58:00,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:58:00,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:58:00,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:58:00,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:58:00,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:58:00,897 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:58:00,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:58:01,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:58:01,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:58:01,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:58:01,239 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:58:01,240 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:58:01,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2020-10-21 21:58:01,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8259d14df/389f97dcdda44be7976a135e1b74c5c1/FLAG91f7ddad1 [2020-10-21 21:58:01,989 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:58:01,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2020-10-21 21:58:02,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8259d14df/389f97dcdda44be7976a135e1b74c5c1/FLAG91f7ddad1 [2020-10-21 21:58:02,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8259d14df/389f97dcdda44be7976a135e1b74c5c1 [2020-10-21 21:58:02,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:58:02,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:58:02,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:58:02,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:58:02,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:58:02,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:58:02" (1/1) ... [2020-10-21 21:58:02,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4eda93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:02, skipping insertion in model container [2020-10-21 21:58:02,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:58:02" (1/1) ... [2020-10-21 21:58:02,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:58:02,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:58:02,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:58:02,869 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:58:02,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:58:03,064 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:58:03,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03 WrapperNode [2020-10-21 21:58:03,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:58:03,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:58:03,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:58:03,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:58:03,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:58:03,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:58:03,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:58:03,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:58:03,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (1/1) ... [2020-10-21 21:58:03,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:58:03,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:58:03,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:58:03,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:58:03,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (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-21 21:58:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:58:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:58:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:58:03,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:58:03,289 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:58:03,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:58:03,289 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:58:03,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:58:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:58:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:58:03,298 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 21:58:06,726 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:58:06,727 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:58:06,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:58:06 BoogieIcfgContainer [2020-10-21 21:58:06,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:58:06,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:58:06,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:58:06,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:58:06,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:58:02" (1/3) ... [2020-10-21 21:58:06,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bddd306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:58:06, skipping insertion in model container [2020-10-21 21:58:06,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:58:03" (2/3) ... [2020-10-21 21:58:06,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bddd306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:58:06, skipping insertion in model container [2020-10-21 21:58:06,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:58:06" (3/3) ... [2020-10-21 21:58:06,738 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_tso.opt.i [2020-10-21 21:58:06,751 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:58:06,751 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:58:06,759 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:58:06,760 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:58:06,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,802 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,830 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,837 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,841 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:58:06,846 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:58:06,860 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 21:58:06,882 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:58:06,883 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:58:06,883 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:58:06,883 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:58:06,883 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:58:06,883 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:58:06,883 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:58:06,884 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:58:06,898 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:58:06,901 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 89 transitions, 188 flow [2020-10-21 21:58:06,904 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 89 transitions, 188 flow [2020-10-21 21:58:06,907 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 93 places, 89 transitions, 188 flow [2020-10-21 21:58:06,954 INFO L129 PetriNetUnfolder]: 3/87 cut-off events. [2020-10-21 21:58:06,954 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:58:06,959 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 3/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2020-10-21 21:58:06,962 INFO L116 LiptonReduction]: Number of co-enabled transitions 1268 [2020-10-21 21:58:07,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:07,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:07,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:07,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:07,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:07,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:07,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:07,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:07,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:07,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:07,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:07,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:07,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:07,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:07,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:07,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:07,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:07,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:07,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:07,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:07,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:07,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:07,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:08,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:08,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:08,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:08,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:08,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:08,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:08,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:08,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:08,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:08,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:08,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:08,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:08,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:08,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:08,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:08,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:08,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:08,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:08,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:08,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:08,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:08,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:08,834 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 21:58:08,978 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 21:58:09,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:09,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:09,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:09,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:09,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:09,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:09,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:09,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:09,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:09,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:09,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:09,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:09,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 21:58:09,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:09,054 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-21 21:58:09,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:09,056 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-21 21:58:09,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:09,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:58:09,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:09,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:58:09,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:09,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 21:58:09,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:09,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 21:58:09,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:10,864 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-21 21:58:10,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 21:58:10,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:10,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:58:10,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:11,733 WARN L193 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-21 21:58:11,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:11,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:11,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:11,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:11,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:11,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:11,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:11,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:11,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:11,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:11,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:11,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:11,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:11,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:11,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:11,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:12,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 21:58:12,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:12,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 21:58:12,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 21:58:12,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-21 21:58:12,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 21:58:12,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:12,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:12,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:12,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:12,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:12,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:12,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:12,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:12,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:12,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:12,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:12,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:12,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:12,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:12,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:12,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:12,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:12,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:12,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:12,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:12,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:12,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:12,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:12,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:12,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:12,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:12,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:12,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:12,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:13,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:13,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:13,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:13,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:13,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:13,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:13,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:13,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:13,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:13,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:13,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:58:13,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:13,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:58:13,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:13,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:13,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:58:13,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:58:13,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:58:13,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:13,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:13,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:58:13,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:58:13,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:58:13,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:58:13,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:13,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:13,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:13,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:58:13,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:58:14,183 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-10-21 21:58:14,344 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-21 21:58:14,352 INFO L131 LiptonReduction]: Checked pairs total: 4138 [2020-10-21 21:58:14,353 INFO L133 LiptonReduction]: Total number of compositions: 78 [2020-10-21 21:58:14,359 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 24 transitions, 58 flow [2020-10-21 21:58:14,381 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 302 states. [2020-10-21 21:58:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2020-10-21 21:58:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-21 21:58:14,389 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:14,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-21 21:58:14,390 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1056304300, now seen corresponding path program 1 times [2020-10-21 21:58:14,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:14,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619308451] [2020-10-21 21:58:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:14,637 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-21 21:58:14,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619308451] [2020-10-21 21:58:14,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:14,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:58:14,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620020795] [2020-10-21 21:58:14,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:58:14,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:14,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:58:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:58:14,662 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2020-10-21 21:58:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:14,753 INFO L93 Difference]: Finished difference Result 266 states and 660 transitions. [2020-10-21 21:58:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:58:14,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-10-21 21:58:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:14,770 INFO L225 Difference]: With dead ends: 266 [2020-10-21 21:58:14,770 INFO L226 Difference]: Without dead ends: 224 [2020-10-21 21:58:14,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:58:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-21 21:58:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2020-10-21 21:58:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-21 21:58:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 547 transitions. [2020-10-21 21:58:14,832 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 547 transitions. Word has length 6 [2020-10-21 21:58:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:14,833 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 547 transitions. [2020-10-21 21:58:14,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:58:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 547 transitions. [2020-10-21 21:58:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 21:58:14,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:14,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:14,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:58:14,835 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1494734065, now seen corresponding path program 1 times [2020-10-21 21:58:14,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:14,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72321200] [2020-10-21 21:58:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:15,086 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-21 21:58:15,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72321200] [2020-10-21 21:58:15,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:15,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:58:15,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270598700] [2020-10-21 21:58:15,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:58:15,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:15,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:58:15,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:58:15,090 INFO L87 Difference]: Start difference. First operand 224 states and 547 transitions. Second operand 5 states. [2020-10-21 21:58:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:15,294 INFO L93 Difference]: Finished difference Result 260 states and 603 transitions. [2020-10-21 21:58:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:58:15,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-21 21:58:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:15,301 INFO L225 Difference]: With dead ends: 260 [2020-10-21 21:58:15,301 INFO L226 Difference]: Without dead ends: 218 [2020-10-21 21:58:15,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:58:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-10-21 21:58:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2020-10-21 21:58:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-10-21 21:58:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 529 transitions. [2020-10-21 21:58:15,318 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 529 transitions. Word has length 8 [2020-10-21 21:58:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:15,319 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 529 transitions. [2020-10-21 21:58:15,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:58:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 529 transitions. [2020-10-21 21:58:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 21:58:15,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:15,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:15,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:58:15,321 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash 882054689, now seen corresponding path program 1 times [2020-10-21 21:58:15,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:15,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83667638] [2020-10-21 21:58:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:15,463 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-21 21:58:15,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83667638] [2020-10-21 21:58:15,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:15,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:58:15,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136736675] [2020-10-21 21:58:15,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:58:15,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:58:15,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:58:15,466 INFO L87 Difference]: Start difference. First operand 218 states and 529 transitions. Second operand 6 states. [2020-10-21 21:58:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:15,706 INFO L93 Difference]: Finished difference Result 233 states and 541 transitions. [2020-10-21 21:58:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:58:15,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-21 21:58:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:15,708 INFO L225 Difference]: With dead ends: 233 [2020-10-21 21:58:15,708 INFO L226 Difference]: Without dead ends: 198 [2020-10-21 21:58:15,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:58:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-21 21:58:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2020-10-21 21:58:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-21 21:58:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 473 transitions. [2020-10-21 21:58:15,723 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 473 transitions. Word has length 9 [2020-10-21 21:58:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:15,723 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 473 transitions. [2020-10-21 21:58:15,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:58:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 473 transitions. [2020-10-21 21:58:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 21:58:15,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:15,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:15,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:58:15,725 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash -620638922, now seen corresponding path program 1 times [2020-10-21 21:58:15,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:15,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18028839] [2020-10-21 21:58:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:15,829 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-21 21:58:15,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18028839] [2020-10-21 21:58:15,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:15,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:58:15,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207830115] [2020-10-21 21:58:15,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:58:15,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:15,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:58:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:58:15,832 INFO L87 Difference]: Start difference. First operand 198 states and 473 transitions. Second operand 5 states. [2020-10-21 21:58:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:15,915 INFO L93 Difference]: Finished difference Result 205 states and 469 transitions. [2020-10-21 21:58:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:58:15,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-21 21:58:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:15,918 INFO L225 Difference]: With dead ends: 205 [2020-10-21 21:58:15,918 INFO L226 Difference]: Without dead ends: 176 [2020-10-21 21:58:15,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:58:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-21 21:58:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-21 21:58:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-21 21:58:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 411 transitions. [2020-10-21 21:58:15,928 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 411 transitions. Word has length 11 [2020-10-21 21:58:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:15,929 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 411 transitions. [2020-10-21 21:58:15,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:58:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 411 transitions. [2020-10-21 21:58:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 21:58:15,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:15,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:15,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:58:15,931 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash -273021435, now seen corresponding path program 1 times [2020-10-21 21:58:15,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:15,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142196461] [2020-10-21 21:58:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:16,145 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-21 21:58:16,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142196461] [2020-10-21 21:58:16,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:16,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:58:16,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935622903] [2020-10-21 21:58:16,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:58:16,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:16,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:58:16,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:58:16,147 INFO L87 Difference]: Start difference. First operand 176 states and 411 transitions. Second operand 7 states. [2020-10-21 21:58:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:16,342 INFO L93 Difference]: Finished difference Result 192 states and 433 transitions. [2020-10-21 21:58:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:58:16,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-21 21:58:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:16,345 INFO L225 Difference]: With dead ends: 192 [2020-10-21 21:58:16,345 INFO L226 Difference]: Without dead ends: 174 [2020-10-21 21:58:16,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:58:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-21 21:58:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-10-21 21:58:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-21 21:58:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 405 transitions. [2020-10-21 21:58:16,353 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 405 transitions. Word has length 12 [2020-10-21 21:58:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:16,353 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 405 transitions. [2020-10-21 21:58:16,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:58:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 405 transitions. [2020-10-21 21:58:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 21:58:16,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:16,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:16,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:58:16,356 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:16,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1027541513, now seen corresponding path program 1 times [2020-10-21 21:58:16,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:16,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011671510] [2020-10-21 21:58:16,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:16,489 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-21 21:58:16,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011671510] [2020-10-21 21:58:16,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:16,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:58:16,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483170284] [2020-10-21 21:58:16,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:58:16,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:58:16,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:58:16,492 INFO L87 Difference]: Start difference. First operand 174 states and 405 transitions. Second operand 4 states. [2020-10-21 21:58:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:16,519 INFO L93 Difference]: Finished difference Result 138 states and 272 transitions. [2020-10-21 21:58:16,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:58:16,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 21:58:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:16,521 INFO L225 Difference]: With dead ends: 138 [2020-10-21 21:58:16,521 INFO L226 Difference]: Without dead ends: 96 [2020-10-21 21:58:16,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:58:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-21 21:58:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-10-21 21:58:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-21 21:58:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 171 transitions. [2020-10-21 21:58:16,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 171 transitions. Word has length 13 [2020-10-21 21:58:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:16,525 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 171 transitions. [2020-10-21 21:58:16,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:58:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 171 transitions. [2020-10-21 21:58:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 21:58:16,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:16,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:16,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:58:16,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1863763074, now seen corresponding path program 1 times [2020-10-21 21:58:16,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:16,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309131833] [2020-10-21 21:58:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:17,029 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2020-10-21 21:58:17,140 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-21 21:58:17,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309131833] [2020-10-21 21:58:17,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:17,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:58:17,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411529089] [2020-10-21 21:58:17,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 21:58:17,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:17,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 21:58:17,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:58:17,143 INFO L87 Difference]: Start difference. First operand 96 states and 171 transitions. Second operand 8 states. [2020-10-21 21:58:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:17,432 INFO L93 Difference]: Finished difference Result 100 states and 173 transitions. [2020-10-21 21:58:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 21:58:17,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-21 21:58:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:17,433 INFO L225 Difference]: With dead ends: 100 [2020-10-21 21:58:17,434 INFO L226 Difference]: Without dead ends: 94 [2020-10-21 21:58:17,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:58:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-21 21:58:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-21 21:58:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-21 21:58:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 167 transitions. [2020-10-21 21:58:17,438 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 167 transitions. Word has length 14 [2020-10-21 21:58:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:17,438 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 167 transitions. [2020-10-21 21:58:17,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 21:58:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 167 transitions. [2020-10-21 21:58:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 21:58:17,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:17,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:17,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:58:17,440 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1108085008, now seen corresponding path program 1 times [2020-10-21 21:58:17,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:17,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645943308] [2020-10-21 21:58:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:17,881 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 28 [2020-10-21 21:58:18,142 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2020-10-21 21:58:18,354 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-21 21:58:18,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645943308] [2020-10-21 21:58:18,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:18,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 21:58:18,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145962856] [2020-10-21 21:58:18,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 21:58:18,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 21:58:18,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:58:18,356 INFO L87 Difference]: Start difference. First operand 94 states and 167 transitions. Second operand 10 states. [2020-10-21 21:58:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:18,883 INFO L93 Difference]: Finished difference Result 114 states and 200 transitions. [2020-10-21 21:58:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-21 21:58:18,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-21 21:58:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:18,886 INFO L225 Difference]: With dead ends: 114 [2020-10-21 21:58:18,886 INFO L226 Difference]: Without dead ends: 109 [2020-10-21 21:58:18,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-21 21:58:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-21 21:58:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2020-10-21 21:58:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-21 21:58:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 180 transitions. [2020-10-21 21:58:18,892 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 180 transitions. Word has length 15 [2020-10-21 21:58:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:18,893 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 180 transitions. [2020-10-21 21:58:18,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 21:58:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 180 transitions. [2020-10-21 21:58:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 21:58:18,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:18,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:18,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:58:18,894 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1653817914, now seen corresponding path program 2 times [2020-10-21 21:58:18,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:18,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208108819] [2020-10-21 21:58:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:19,388 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-21 21:58:19,443 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-21 21:58:19,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208108819] [2020-10-21 21:58:19,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:19,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 21:58:19,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322920876] [2020-10-21 21:58:19,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 21:58:19,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 21:58:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:58:19,446 INFO L87 Difference]: Start difference. First operand 101 states and 180 transitions. Second operand 9 states. [2020-10-21 21:58:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:19,992 INFO L93 Difference]: Finished difference Result 159 states and 274 transitions. [2020-10-21 21:58:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-21 21:58:19,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-21 21:58:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:19,995 INFO L225 Difference]: With dead ends: 159 [2020-10-21 21:58:19,995 INFO L226 Difference]: Without dead ends: 139 [2020-10-21 21:58:19,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-21 21:58:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-21 21:58:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2020-10-21 21:58:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-21 21:58:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 222 transitions. [2020-10-21 21:58:20,002 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 222 transitions. Word has length 15 [2020-10-21 21:58:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:20,003 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 222 transitions. [2020-10-21 21:58:20,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 21:58:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 222 transitions. [2020-10-21 21:58:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 21:58:20,006 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:20,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:20,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:58:20,007 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash 458753618, now seen corresponding path program 3 times [2020-10-21 21:58:20,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:20,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979375228] [2020-10-21 21:58:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:20,615 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 39 [2020-10-21 21:58:20,676 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-21 21:58:20,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979375228] [2020-10-21 21:58:20,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:20,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 21:58:20,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042382] [2020-10-21 21:58:20,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 21:58:20,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 21:58:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:58:20,678 INFO L87 Difference]: Start difference. First operand 126 states and 222 transitions. Second operand 9 states. [2020-10-21 21:58:20,954 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-10-21 21:58:21,173 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-10-21 21:58:21,441 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-10-21 21:58:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:21,876 INFO L93 Difference]: Finished difference Result 191 states and 332 transitions. [2020-10-21 21:58:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 21:58:21,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-21 21:58:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:21,878 INFO L225 Difference]: With dead ends: 191 [2020-10-21 21:58:21,878 INFO L226 Difference]: Without dead ends: 186 [2020-10-21 21:58:21,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-10-21 21:58:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-21 21:58:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 125. [2020-10-21 21:58:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-21 21:58:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 220 transitions. [2020-10-21 21:58:21,883 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 220 transitions. Word has length 15 [2020-10-21 21:58:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:21,883 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 220 transitions. [2020-10-21 21:58:21,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 21:58:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 220 transitions. [2020-10-21 21:58:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 21:58:21,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:21,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:21,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:58:21,884 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:21,885 INFO L82 PathProgramCache]: Analyzing trace with hash 550923748, now seen corresponding path program 4 times [2020-10-21 21:58:21,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:21,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539898948] [2020-10-21 21:58:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:21,999 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-21 21:58:21,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539898948] [2020-10-21 21:58:22,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:22,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:58:22,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311886198] [2020-10-21 21:58:22,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:58:22,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:58:22,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:58:22,001 INFO L87 Difference]: Start difference. First operand 125 states and 220 transitions. Second operand 5 states. [2020-10-21 21:58:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:22,036 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2020-10-21 21:58:22,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:58:22,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 21:58:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:22,037 INFO L225 Difference]: With dead ends: 97 [2020-10-21 21:58:22,037 INFO L226 Difference]: Without dead ends: 65 [2020-10-21 21:58:22,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:58:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-21 21:58:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2020-10-21 21:58:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-21 21:58:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2020-10-21 21:58:22,040 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 15 [2020-10-21 21:58:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:22,040 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2020-10-21 21:58:22,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:58:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2020-10-21 21:58:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 21:58:22,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:22,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:22,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 21:58:22,042 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash -216382539, now seen corresponding path program 1 times [2020-10-21 21:58:22,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:22,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441973484] [2020-10-21 21:58:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:22,196 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-21 21:58:22,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441973484] [2020-10-21 21:58:22,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:22,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:58:22,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355448395] [2020-10-21 21:58:22,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:58:22,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:58:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:58:22,198 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand 7 states. [2020-10-21 21:58:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:22,265 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2020-10-21 21:58:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:58:22,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-21 21:58:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:22,266 INFO L225 Difference]: With dead ends: 70 [2020-10-21 21:58:22,266 INFO L226 Difference]: Without dead ends: 37 [2020-10-21 21:58:22,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:58:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-21 21:58:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-21 21:58:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-21 21:58:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2020-10-21 21:58:22,269 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2020-10-21 21:58:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:22,269 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2020-10-21 21:58:22,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:58:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2020-10-21 21:58:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 21:58:22,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:22,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:22,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 21:58:22,271 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1537820435, now seen corresponding path program 2 times [2020-10-21 21:58:22,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:22,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907552658] [2020-10-21 21:58:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:22,491 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-21 21:58:22,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907552658] [2020-10-21 21:58:22,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:22,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:58:22,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438819604] [2020-10-21 21:58:22,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:58:22,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:22,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:58:22,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:58:22,495 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 7 states. [2020-10-21 21:58:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:22,587 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2020-10-21 21:58:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:58:22,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-21 21:58:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:22,588 INFO L225 Difference]: With dead ends: 56 [2020-10-21 21:58:22,588 INFO L226 Difference]: Without dead ends: 34 [2020-10-21 21:58:22,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:58:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-21 21:58:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-21 21:58:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-21 21:58:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2020-10-21 21:58:22,591 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 19 [2020-10-21 21:58:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:22,591 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2020-10-21 21:58:22,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:58:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2020-10-21 21:58:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 21:58:22,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:22,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:22,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 21:58:22,593 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1226711723, now seen corresponding path program 3 times [2020-10-21 21:58:22,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:22,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921509383] [2020-10-21 21:58:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:58:23,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921509383] [2020-10-21 21:58:23,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:23,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 21:58:23,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485052677] [2020-10-21 21:58:23,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 21:58:23,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 21:58:23,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:58:23,132 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 9 states. [2020-10-21 21:58:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:23,433 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2020-10-21 21:58:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 21:58:23,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-21 21:58:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:23,434 INFO L225 Difference]: With dead ends: 45 [2020-10-21 21:58:23,434 INFO L226 Difference]: Without dead ends: 32 [2020-10-21 21:58:23,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-21 21:58:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-21 21:58:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-21 21:58:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-21 21:58:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-21 21:58:23,436 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 19 [2020-10-21 21:58:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:23,437 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-21 21:58:23,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 21:58:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-10-21 21:58:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 21:58:23,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:23,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:23,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 21:58:23,438 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1338404429, now seen corresponding path program 4 times [2020-10-21 21:58:23,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:23,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109452190] [2020-10-21 21:58:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:23,896 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2020-10-21 21:58:24,026 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2020-10-21 21:58:24,173 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2020-10-21 21:58:24,263 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-21 21:58:24,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109452190] [2020-10-21 21:58:24,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:24,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 21:58:24,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137841832] [2020-10-21 21:58:24,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 21:58:24,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 21:58:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-21 21:58:24,266 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 11 states. [2020-10-21 21:58:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:24,934 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-10-21 21:58:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-21 21:58:24,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-10-21 21:58:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:24,936 INFO L225 Difference]: With dead ends: 41 [2020-10-21 21:58:24,936 INFO L226 Difference]: Without dead ends: 30 [2020-10-21 21:58:24,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2020-10-21 21:58:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-21 21:58:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-21 21:58:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-21 21:58:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-10-21 21:58:24,941 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2020-10-21 21:58:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:24,942 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-10-21 21:58:24,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 21:58:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-10-21 21:58:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 21:58:24,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:58:24,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:58:24,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 21:58:24,943 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:58:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:58:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 527307285, now seen corresponding path program 5 times [2020-10-21 21:58:24,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:58:24,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372974010] [2020-10-21 21:58:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:58:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:58:25,266 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2020-10-21 21:58:25,561 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 41 [2020-10-21 21:58:25,788 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2020-10-21 21:58:25,994 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2020-10-21 21:58:26,032 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-21 21:58:26,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372974010] [2020-10-21 21:58:26,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:58:26,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 21:58:26,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628439958] [2020-10-21 21:58:26,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 21:58:26,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:58:26,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 21:58:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:58:26,037 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 9 states. [2020-10-21 21:58:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:58:26,325 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-10-21 21:58:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 21:58:26,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-21 21:58:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:58:26,325 INFO L225 Difference]: With dead ends: 29 [2020-10-21 21:58:26,326 INFO L226 Difference]: Without dead ends: 0 [2020-10-21 21:58:26,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-21 21:58:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-21 21:58:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-21 21:58:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-21 21:58:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-21 21:58:26,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-10-21 21:58:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:58:26,328 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-21 21:58:26,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 21:58:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-21 21:58:26,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-21 21:58:26,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 21:58:26,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:58:26 BasicIcfg [2020-10-21 21:58:26,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:58:26,334 INFO L168 Benchmark]: Toolchain (without parser) took 24152.43 ms. Allocated memory was 146.8 MB in the beginning and 539.5 MB in the end (delta: 392.7 MB). Free memory was 100.4 MB in the beginning and 409.9 MB in the end (delta: -309.5 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2020-10-21 21:58:26,335 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 21:58:26,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.49 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 99.6 MB in the beginning and 152.2 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-10-21 21:58:26,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.37 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 148.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-10-21 21:58:26,337 INFO L168 Benchmark]: Boogie Preprocessor took 51.94 ms. Allocated memory is still 203.4 MB. Free memory was 148.2 MB in the beginning and 144.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-21 21:58:26,338 INFO L168 Benchmark]: RCFGBuilder took 3523.90 ms. Allocated memory was 203.4 MB in the beginning and 295.2 MB in the end (delta: 91.8 MB). Free memory was 144.9 MB in the beginning and 249.0 MB in the end (delta: -104.1 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2020-10-21 21:58:26,338 INFO L168 Benchmark]: TraceAbstraction took 19600.51 ms. Allocated memory was 295.2 MB in the beginning and 539.5 MB in the end (delta: 244.3 MB). Free memory was 249.0 MB in the beginning and 409.9 MB in the end (delta: -160.9 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. [2020-10-21 21:58:26,342 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 874.49 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 99.6 MB in the beginning and 152.2 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.37 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 148.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.94 ms. Allocated memory is still 203.4 MB. Free memory was 148.2 MB in the beginning and 144.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3523.90 ms. Allocated memory was 203.4 MB in the beginning and 295.2 MB in the end (delta: 91.8 MB). Free memory was 144.9 MB in the beginning and 249.0 MB in the end (delta: -104.1 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19600.51 ms. Allocated memory was 295.2 MB in the beginning and 539.5 MB in the end (delta: 244.3 MB). Free memory was 249.0 MB in the beginning and 409.9 MB in the end (delta: -160.9 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 895 VarBasedMoverChecksPositive, 75 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.4s, 93 PlacesBefore, 30 PlacesAfterwards, 89 TransitionsBefore, 24 TransitionsAfterwards, 1268 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4138 MoverChecksTotal - PositiveResult [Line: 17]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 17]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 324 SDtfs, 369 SDslu, 946 SDs, 0 SdLazy, 1027 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 95 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 50199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...