/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/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:15:28,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:15:28,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:15:28,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:15:28,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:15:28,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:15:28,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:15:28,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:15:28,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:15:28,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:15:28,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:15:28,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:15:28,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:15:28,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:15:28,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:15:28,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:15:28,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:15:28,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:15:28,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:15:28,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:15:28,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:15:28,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:15:28,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:15:28,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:15:28,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:15:28,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:15:28,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:15:28,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:15:28,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:15:28,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:15:28,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:15:28,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:15:28,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:15:28,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:15:28,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:15:28,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:15:28,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:15:28,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:15:28,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:15:28,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:15:28,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:15:28,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:15:28,660 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:15:28,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:15:28,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:15:28,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:15:28,663 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:15:28,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:15:28,663 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:15:28,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:15:28,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:15:28,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:15:28,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:15:28,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:15:28,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:15:28,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:15:28,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:15:28,665 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:15:28,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:15:28,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:15:28,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:15:28,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:15:28,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:15:28,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:15:28,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:15:28,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:15:28,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:15:28,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:15:28,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:15:28,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:15:28,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:15:28,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:15:29,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:15:29,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:15:29,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:15:29,035 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:15:29,036 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:15:29,037 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-16 11:15:29,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e488f61bf/c014c3a3adf442d4b8b228f252190850/FLAGb65f671dd [2020-10-16 11:15:29,624 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:15:29,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-16 11:15:29,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e488f61bf/c014c3a3adf442d4b8b228f252190850/FLAGb65f671dd [2020-10-16 11:15:29,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e488f61bf/c014c3a3adf442d4b8b228f252190850 [2020-10-16 11:15:29,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:15:29,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:15:29,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:15:29,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:15:29,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:15:29,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:15:29" (1/1) ... [2020-10-16 11:15:29,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647a3d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:29, skipping insertion in model container [2020-10-16 11:15:29,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:15:29" (1/1) ... [2020-10-16 11:15:29,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:15:30,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:15:30,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:15:30,706 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:15:30,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:15:30,892 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:15:30,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30 WrapperNode [2020-10-16 11:15:30,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:15:30,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:15:30,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:15:30,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:15:30,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:30,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:30,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:15:30,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:15:30,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:15:30,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:15:30,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:30,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:30,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:30,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:31,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:31,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:31,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... [2020-10-16 11:15:31,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:15:31,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:15:31,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:15:31,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:15:31,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:15:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:15:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:15:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:15:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:15:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:15:31,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:15:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:15:31,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:15:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:15:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:15:31,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:15:31,138 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:15:34,808 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:15:34,809 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:15:34,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:15:34 BoogieIcfgContainer [2020-10-16 11:15:34,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:15:34,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:15:34,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:15:34,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:15:34,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:15:29" (1/3) ... [2020-10-16 11:15:34,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226daa82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:15:34, skipping insertion in model container [2020-10-16 11:15:34,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:30" (2/3) ... [2020-10-16 11:15:34,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226daa82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:15:34, skipping insertion in model container [2020-10-16 11:15:34,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:15:34" (3/3) ... [2020-10-16 11:15:34,822 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2020-10-16 11:15:34,836 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:15:34,837 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:15:34,848 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:15:34,850 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:15:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,915 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,916 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,936 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,939 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,958 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:15:34,964 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:15:34,981 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 11:15:35,086 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:15:35,087 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:15:35,087 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:15:35,087 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:15:35,087 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:15:35,088 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:15:35,088 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:15:35,088 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:15:35,105 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:15:35,109 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-16 11:15:35,112 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-16 11:15:35,114 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 11:15:35,160 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 11:15:35,160 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:15:35,166 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 11:15:35,169 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 11:15:35,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:35,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:35,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:35,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:35,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:35,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:35,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,438 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-16 11:15:35,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,440 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-16 11:15:35,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:35,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:35,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:35,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:35,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,527 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-16 11:15:35,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,529 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-16 11:15:35,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:35,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:35,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:35,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:35,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:35,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:35,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:35,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:35,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:15:35,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:36,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:36,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:36,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:36,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:36,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:36,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:36,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,170 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-16 11:15:36,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,173 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-16 11:15:36,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:36,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:36,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:36,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:36,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:36,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:36,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:36,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:36,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:36,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:36,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:36,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:36,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:36,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:36,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:36,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:36,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:36,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:36,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:15:36,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:15:36,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:15:36,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:15:36,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:36,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:36,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:36,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:36,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:36,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:36,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:36,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:36,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:36,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,723 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-16 11:15:36,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:36,727 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-16 11:15:36,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,071 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 11:15:37,202 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 11:15:37,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:37,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:37,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:37,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:37,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:37,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:37,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:37,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,299 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-16 11:15:37,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,301 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-16 11:15:37,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:37,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:37,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:37,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:37,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:37,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:37,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:37,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:37,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:37,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:37,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:37,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:15:37,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:15:37,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:37,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:15:37,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:37,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 11:15:37,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:38,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:38,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:38,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:38,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:38,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:38,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:38,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:15:38,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:38,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:38,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:38,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:38,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:38,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:38,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,228 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-16 11:15:38,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,230 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-16 11:15:38,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:38,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:38,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:38,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:38,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:38,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:38,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:38,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,460 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-16 11:15:38,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,462 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-16 11:15:38,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:38,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:38,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:38,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,751 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 11:15:38,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:38,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:38,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:38,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:38,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:38,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:38,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:38,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:38,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:38,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:38,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:38,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:38,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:15:38,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:38,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:15:38,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:15:38,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:15:38,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:38,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:15:38,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:39,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:39,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:39,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:39,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:39,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:39,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:39,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:39,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:39,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:39,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:39,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:39,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:39,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:39,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:39,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:39,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:39,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:39,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:15:39,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:15:39,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:39,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:39,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:39,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:39,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:39,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:15:39,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:39,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:15:39,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:15:39,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:15:39,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:39,132 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-16 11:15:39,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:39,135 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-16 11:15:39,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:39,813 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 11:15:39,906 INFO L132 LiptonReduction]: Checked pairs total: 3006 [2020-10-16 11:15:39,907 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 11:15:39,921 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-10-16 11:15:39,955 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 266 states. [2020-10-16 11:15:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2020-10-16 11:15:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 11:15:39,963 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:39,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 11:15:39,964 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-16 11:15:39,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:39,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460061386] [2020-10-16 11:15:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:40,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460061386] [2020-10-16 11:15:40,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:40,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:15:40,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920033133] [2020-10-16 11:15:40,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:15:40,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:15:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:40,215 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 3 states. [2020-10-16 11:15:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:40,312 INFO L93 Difference]: Finished difference Result 230 states and 564 transitions. [2020-10-16 11:15:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:15:40,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 11:15:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:40,328 INFO L225 Difference]: With dead ends: 230 [2020-10-16 11:15:40,328 INFO L226 Difference]: Without dead ends: 194 [2020-10-16 11:15:40,330 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-16 11:15:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-16 11:15:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-16 11:15:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-16 11:15:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 468 transitions. [2020-10-16 11:15:40,384 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 468 transitions. Word has length 5 [2020-10-16 11:15:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:40,384 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 468 transitions. [2020-10-16 11:15:40,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:15:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 468 transitions. [2020-10-16 11:15:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 11:15:40,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:40,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:40,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:15:40,386 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-16 11:15:40,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:40,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702010133] [2020-10-16 11:15:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:40,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702010133] [2020-10-16 11:15:40,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:40,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:15:40,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631402012] [2020-10-16 11:15:40,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:15:40,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:15:40,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:15:40,576 INFO L87 Difference]: Start difference. First operand 194 states and 468 transitions. Second operand 4 states. [2020-10-16 11:15:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:40,636 INFO L93 Difference]: Finished difference Result 194 states and 444 transitions. [2020-10-16 11:15:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:15:40,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-16 11:15:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:40,639 INFO L225 Difference]: With dead ends: 194 [2020-10-16 11:15:40,639 INFO L226 Difference]: Without dead ends: 158 [2020-10-16 11:15:40,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-16 11:15:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-10-16 11:15:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-16 11:15:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 366 transitions. [2020-10-16 11:15:40,658 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 366 transitions. Word has length 8 [2020-10-16 11:15:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:40,658 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 366 transitions. [2020-10-16 11:15:40,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:15:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 366 transitions. [2020-10-16 11:15:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:15:40,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:40,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:40,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:15:40,661 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1593199242, now seen corresponding path program 1 times [2020-10-16 11:15:40,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:40,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96455145] [2020-10-16 11:15:40,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:40,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96455145] [2020-10-16 11:15:40,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:40,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:15:40,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885846126] [2020-10-16 11:15:40,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:15:40,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:40,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:15:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:15:40,954 INFO L87 Difference]: Start difference. First operand 158 states and 366 transitions. Second operand 4 states. [2020-10-16 11:15:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:40,992 INFO L93 Difference]: Finished difference Result 164 states and 367 transitions. [2020-10-16 11:15:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:15:40,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 11:15:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:40,995 INFO L225 Difference]: With dead ends: 164 [2020-10-16 11:15:40,995 INFO L226 Difference]: Without dead ends: 146 [2020-10-16 11:15:40,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-10-16 11:15:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2020-10-16 11:15:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-16 11:15:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 334 transitions. [2020-10-16 11:15:41,006 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 334 transitions. Word has length 11 [2020-10-16 11:15:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:41,006 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 334 transitions. [2020-10-16 11:15:41,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:15:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 334 transitions. [2020-10-16 11:15:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:15:41,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:41,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:41,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:15:41,009 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2054367808, now seen corresponding path program 1 times [2020-10-16 11:15:41,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:41,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135780492] [2020-10-16 11:15:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:41,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135780492] [2020-10-16 11:15:41,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:41,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:15:41,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160416161] [2020-10-16 11:15:41,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:15:41,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:15:41,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:41,396 INFO L87 Difference]: Start difference. First operand 146 states and 334 transitions. Second operand 9 states. [2020-10-16 11:15:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:41,914 INFO L93 Difference]: Finished difference Result 207 states and 463 transitions. [2020-10-16 11:15:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 11:15:41,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-16 11:15:41,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:41,918 INFO L225 Difference]: With dead ends: 207 [2020-10-16 11:15:41,918 INFO L226 Difference]: Without dead ends: 190 [2020-10-16 11:15:41,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-16 11:15:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-10-16 11:15:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2020-10-16 11:15:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-10-16 11:15:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 401 transitions. [2020-10-16 11:15:41,930 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 401 transitions. Word has length 13 [2020-10-16 11:15:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:41,931 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 401 transitions. [2020-10-16 11:15:41,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:15:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 401 transitions. [2020-10-16 11:15:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:15:41,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:41,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:41,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:15:41,933 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2058692308, now seen corresponding path program 2 times [2020-10-16 11:15:41,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:41,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531289436] [2020-10-16 11:15:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:42,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531289436] [2020-10-16 11:15:42,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:42,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:15:42,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418479659] [2020-10-16 11:15:42,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:15:42,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:15:42,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:42,258 INFO L87 Difference]: Start difference. First operand 175 states and 401 transitions. Second operand 9 states. [2020-10-16 11:15:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:42,563 INFO L93 Difference]: Finished difference Result 209 states and 470 transitions. [2020-10-16 11:15:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:42,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-16 11:15:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:42,567 INFO L225 Difference]: With dead ends: 209 [2020-10-16 11:15:42,567 INFO L226 Difference]: Without dead ends: 195 [2020-10-16 11:15:42,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:15:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-10-16 11:15:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 172. [2020-10-16 11:15:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-16 11:15:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 396 transitions. [2020-10-16 11:15:42,588 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 396 transitions. Word has length 13 [2020-10-16 11:15:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:42,589 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 396 transitions. [2020-10-16 11:15:42,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:15:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 396 transitions. [2020-10-16 11:15:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:15:42,593 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:42,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:42,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:15:42,594 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash 434594124, now seen corresponding path program 3 times [2020-10-16 11:15:42,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:42,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952298606] [2020-10-16 11:15:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:42,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952298606] [2020-10-16 11:15:42,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:42,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:15:42,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817845509] [2020-10-16 11:15:42,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:15:42,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:42,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:15:42,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:15:42,942 INFO L87 Difference]: Start difference. First operand 172 states and 396 transitions. Second operand 8 states. [2020-10-16 11:15:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:43,499 INFO L93 Difference]: Finished difference Result 216 states and 481 transitions. [2020-10-16 11:15:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 11:15:43,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-16 11:15:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:43,502 INFO L225 Difference]: With dead ends: 216 [2020-10-16 11:15:43,502 INFO L226 Difference]: Without dead ends: 201 [2020-10-16 11:15:43,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-16 11:15:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-16 11:15:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 165. [2020-10-16 11:15:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-10-16 11:15:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 375 transitions. [2020-10-16 11:15:43,510 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 375 transitions. Word has length 13 [2020-10-16 11:15:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:43,510 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 375 transitions. [2020-10-16 11:15:43,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:15:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 375 transitions. [2020-10-16 11:15:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:15:43,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:43,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:43,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:15:43,514 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -740690617, now seen corresponding path program 1 times [2020-10-16 11:15:43,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:43,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141054742] [2020-10-16 11:15:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:43,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141054742] [2020-10-16 11:15:43,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:43,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:15:43,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823081122] [2020-10-16 11:15:43,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:15:43,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:15:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:43,746 INFO L87 Difference]: Start difference. First operand 165 states and 375 transitions. Second operand 9 states. [2020-10-16 11:15:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:44,378 INFO L93 Difference]: Finished difference Result 324 states and 670 transitions. [2020-10-16 11:15:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-16 11:15:44,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-16 11:15:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:44,381 INFO L225 Difference]: With dead ends: 324 [2020-10-16 11:15:44,381 INFO L226 Difference]: Without dead ends: 250 [2020-10-16 11:15:44,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-10-16 11:15:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-16 11:15:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 170. [2020-10-16 11:15:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-16 11:15:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 365 transitions. [2020-10-16 11:15:44,388 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 365 transitions. Word has length 14 [2020-10-16 11:15:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:44,388 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 365 transitions. [2020-10-16 11:15:44,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:15:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 365 transitions. [2020-10-16 11:15:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:15:44,389 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:44,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:44,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:15:44,390 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:44,390 INFO L82 PathProgramCache]: Analyzing trace with hash -740958736, now seen corresponding path program 1 times [2020-10-16 11:15:44,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:44,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153240481] [2020-10-16 11:15:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:44,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153240481] [2020-10-16 11:15:44,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:44,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:15:44,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29158997] [2020-10-16 11:15:44,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:15:44,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:44,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:15:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:44,725 INFO L87 Difference]: Start difference. First operand 170 states and 365 transitions. Second operand 9 states. [2020-10-16 11:15:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:45,118 INFO L93 Difference]: Finished difference Result 236 states and 503 transitions. [2020-10-16 11:15:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 11:15:45,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-16 11:15:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:45,124 INFO L225 Difference]: With dead ends: 236 [2020-10-16 11:15:45,124 INFO L226 Difference]: Without dead ends: 209 [2020-10-16 11:15:45,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-16 11:15:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-16 11:15:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 143. [2020-10-16 11:15:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-10-16 11:15:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 303 transitions. [2020-10-16 11:15:45,130 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 303 transitions. Word has length 14 [2020-10-16 11:15:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:45,130 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 303 transitions. [2020-10-16 11:15:45,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:15:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 303 transitions. [2020-10-16 11:15:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:15:45,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:45,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:45,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:15:45,132 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:45,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash -605016637, now seen corresponding path program 2 times [2020-10-16 11:15:45,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:45,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394631527] [2020-10-16 11:15:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:45,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394631527] [2020-10-16 11:15:45,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:45,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:15:45,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797974698] [2020-10-16 11:15:45,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:15:45,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:45,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:15:45,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:45,227 INFO L87 Difference]: Start difference. First operand 143 states and 303 transitions. Second operand 5 states. [2020-10-16 11:15:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:45,342 INFO L93 Difference]: Finished difference Result 217 states and 452 transitions. [2020-10-16 11:15:45,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:15:45,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 11:15:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:45,344 INFO L225 Difference]: With dead ends: 217 [2020-10-16 11:15:45,344 INFO L226 Difference]: Without dead ends: 130 [2020-10-16 11:15:45,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:15:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-16 11:15:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-16 11:15:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-16 11:15:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 258 transitions. [2020-10-16 11:15:45,350 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 258 transitions. Word has length 14 [2020-10-16 11:15:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:45,350 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 258 transitions. [2020-10-16 11:15:45,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:15:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 258 transitions. [2020-10-16 11:15:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:15:45,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:45,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:45,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:15:45,351 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash 587547211, now seen corresponding path program 3 times [2020-10-16 11:15:45,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:45,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384560298] [2020-10-16 11:15:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:45,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384560298] [2020-10-16 11:15:45,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:45,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:15:45,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327772727] [2020-10-16 11:15:45,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:15:45,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:15:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:15:45,558 INFO L87 Difference]: Start difference. First operand 130 states and 258 transitions. Second operand 6 states. [2020-10-16 11:15:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:45,697 INFO L93 Difference]: Finished difference Result 150 states and 295 transitions. [2020-10-16 11:15:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:45,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 11:15:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:45,699 INFO L225 Difference]: With dead ends: 150 [2020-10-16 11:15:45,700 INFO L226 Difference]: Without dead ends: 132 [2020-10-16 11:15:45,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:15:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-16 11:15:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2020-10-16 11:15:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-16 11:15:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 258 transitions. [2020-10-16 11:15:45,706 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 258 transitions. Word has length 14 [2020-10-16 11:15:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:45,706 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 258 transitions. [2020-10-16 11:15:45,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:15:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 258 transitions. [2020-10-16 11:15:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:15:45,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:45,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:45,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:15:45,707 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:45,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1295116191, now seen corresponding path program 4 times [2020-10-16 11:15:45,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:45,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258272237] [2020-10-16 11:15:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:45,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258272237] [2020-10-16 11:15:45,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:45,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:15:45,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272293173] [2020-10-16 11:15:45,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:15:45,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:15:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:15:45,872 INFO L87 Difference]: Start difference. First operand 130 states and 258 transitions. Second operand 8 states. [2020-10-16 11:15:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:46,434 INFO L93 Difference]: Finished difference Result 167 states and 323 transitions. [2020-10-16 11:15:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 11:15:46,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-16 11:15:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:46,437 INFO L225 Difference]: With dead ends: 167 [2020-10-16 11:15:46,437 INFO L226 Difference]: Without dead ends: 149 [2020-10-16 11:15:46,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-16 11:15:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-16 11:15:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2020-10-16 11:15:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-16 11:15:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 246 transitions. [2020-10-16 11:15:46,445 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 246 transitions. Word has length 14 [2020-10-16 11:15:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:46,445 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 246 transitions. [2020-10-16 11:15:46,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:15:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 246 transitions. [2020-10-16 11:15:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:15:46,446 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:46,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:46,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:15:46,447 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1575883427, now seen corresponding path program 1 times [2020-10-16 11:15:46,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:46,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987787165] [2020-10-16 11:15:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:46,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987787165] [2020-10-16 11:15:46,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:46,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:15:46,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101357902] [2020-10-16 11:15:46,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:15:46,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:46,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:15:46,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:15:46,575 INFO L87 Difference]: Start difference. First operand 125 states and 246 transitions. Second operand 6 states. [2020-10-16 11:15:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:46,756 INFO L93 Difference]: Finished difference Result 136 states and 263 transitions. [2020-10-16 11:15:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:15:46,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 11:15:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:46,758 INFO L225 Difference]: With dead ends: 136 [2020-10-16 11:15:46,758 INFO L226 Difference]: Without dead ends: 130 [2020-10-16 11:15:46,759 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-16 11:15:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-16 11:15:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2020-10-16 11:15:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-16 11:15:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 249 transitions. [2020-10-16 11:15:46,763 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 249 transitions. Word has length 15 [2020-10-16 11:15:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:46,764 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 249 transitions. [2020-10-16 11:15:46,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:15:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 249 transitions. [2020-10-16 11:15:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:15:46,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:46,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:46,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:15:46,765 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:46,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1060903253, now seen corresponding path program 1 times [2020-10-16 11:15:46,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:46,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232558671] [2020-10-16 11:15:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:46,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232558671] [2020-10-16 11:15:46,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:46,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:15:46,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632601210] [2020-10-16 11:15:46,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:15:46,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:15:46,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:46,972 INFO L87 Difference]: Start difference. First operand 127 states and 249 transitions. Second operand 9 states. [2020-10-16 11:15:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:47,338 INFO L93 Difference]: Finished difference Result 200 states and 398 transitions. [2020-10-16 11:15:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 11:15:47,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-16 11:15:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:47,340 INFO L225 Difference]: With dead ends: 200 [2020-10-16 11:15:47,340 INFO L226 Difference]: Without dead ends: 137 [2020-10-16 11:15:47,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:15:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-16 11:15:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2020-10-16 11:15:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-16 11:15:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 255 transitions. [2020-10-16 11:15:47,345 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 255 transitions. Word has length 15 [2020-10-16 11:15:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:47,346 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 255 transitions. [2020-10-16 11:15:47,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:15:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 255 transitions. [2020-10-16 11:15:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:15:47,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:47,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:47,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:15:47,347 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:47,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:47,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1653042673, now seen corresponding path program 2 times [2020-10-16 11:15:47,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:47,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972900564] [2020-10-16 11:15:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:47,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972900564] [2020-10-16 11:15:47,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:47,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:15:47,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371170742] [2020-10-16 11:15:47,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:15:47,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:15:47,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:15:47,576 INFO L87 Difference]: Start difference. First operand 130 states and 255 transitions. Second operand 8 states. [2020-10-16 11:15:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:47,988 INFO L93 Difference]: Finished difference Result 157 states and 305 transitions. [2020-10-16 11:15:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 11:15:47,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-16 11:15:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:47,990 INFO L225 Difference]: With dead ends: 157 [2020-10-16 11:15:47,990 INFO L226 Difference]: Without dead ends: 122 [2020-10-16 11:15:47,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-16 11:15:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-16 11:15:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2020-10-16 11:15:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-16 11:15:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 228 transitions. [2020-10-16 11:15:48,001 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 228 transitions. Word has length 15 [2020-10-16 11:15:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:48,002 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 228 transitions. [2020-10-16 11:15:48,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:15:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 228 transitions. [2020-10-16 11:15:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:15:48,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:48,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:48,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:15:48,003 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash -782286779, now seen corresponding path program 3 times [2020-10-16 11:15:48,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:48,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924172312] [2020-10-16 11:15:48,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:48,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924172312] [2020-10-16 11:15:48,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:48,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:15:48,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307906324] [2020-10-16 11:15:48,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:15:48,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:48,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:15:48,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:15:48,209 INFO L87 Difference]: Start difference. First operand 121 states and 228 transitions. Second operand 7 states. [2020-10-16 11:15:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:48,576 INFO L93 Difference]: Finished difference Result 181 states and 326 transitions. [2020-10-16 11:15:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:48,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 11:15:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:48,578 INFO L225 Difference]: With dead ends: 181 [2020-10-16 11:15:48,578 INFO L226 Difference]: Without dead ends: 108 [2020-10-16 11:15:48,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:15:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-16 11:15:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2020-10-16 11:15:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-16 11:15:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 155 transitions. [2020-10-16 11:15:48,582 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 155 transitions. Word has length 15 [2020-10-16 11:15:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:48,582 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 155 transitions. [2020-10-16 11:15:48,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:15:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 155 transitions. [2020-10-16 11:15:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:15:48,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:48,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:48,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:15:48,584 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 65265109, now seen corresponding path program 4 times [2020-10-16 11:15:48,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:48,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178686194] [2020-10-16 11:15:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:48,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178686194] [2020-10-16 11:15:48,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:48,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:15:48,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724734871] [2020-10-16 11:15:48,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:15:48,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:15:48,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:15:48,730 INFO L87 Difference]: Start difference. First operand 90 states and 155 transitions. Second operand 7 states. [2020-10-16 11:15:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:49,048 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2020-10-16 11:15:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:15:49,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 11:15:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:49,050 INFO L225 Difference]: With dead ends: 100 [2020-10-16 11:15:49,050 INFO L226 Difference]: Without dead ends: 66 [2020-10-16 11:15:49,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-16 11:15:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-10-16 11:15:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-16 11:15:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 105 transitions. [2020-10-16 11:15:49,055 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 105 transitions. Word has length 15 [2020-10-16 11:15:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:49,055 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 105 transitions. [2020-10-16 11:15:49,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:15:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2020-10-16 11:15:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:15:49,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:49,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:49,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:15:49,057 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:49,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:49,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1607713765, now seen corresponding path program 1 times [2020-10-16 11:15:49,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:49,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618075102] [2020-10-16 11:15:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:49,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618075102] [2020-10-16 11:15:49,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:49,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:15:49,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21315183] [2020-10-16 11:15:49,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:15:49,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:49,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:15:49,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:15:49,230 INFO L87 Difference]: Start difference. First operand 64 states and 105 transitions. Second operand 6 states. [2020-10-16 11:15:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:49,472 INFO L93 Difference]: Finished difference Result 87 states and 139 transitions. [2020-10-16 11:15:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:49,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 11:15:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:49,473 INFO L225 Difference]: With dead ends: 87 [2020-10-16 11:15:49,474 INFO L226 Difference]: Without dead ends: 61 [2020-10-16 11:15:49,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:15:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-16 11:15:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2020-10-16 11:15:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-16 11:15:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2020-10-16 11:15:49,477 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 16 [2020-10-16 11:15:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:49,478 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2020-10-16 11:15:49,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:15:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2020-10-16 11:15:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:15:49,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:49,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:49,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 11:15:49,479 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1984843427, now seen corresponding path program 2 times [2020-10-16 11:15:49,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:49,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38762198] [2020-10-16 11:15:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:49,882 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-10-16 11:15:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:49,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38762198] [2020-10-16 11:15:49,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:49,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:15:49,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579824873] [2020-10-16 11:15:49,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:15:49,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:49,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:15:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:15:49,990 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 8 states. [2020-10-16 11:15:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:50,282 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2020-10-16 11:15:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:50,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 11:15:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:50,283 INFO L225 Difference]: With dead ends: 65 [2020-10-16 11:15:50,283 INFO L226 Difference]: Without dead ends: 39 [2020-10-16 11:15:50,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:15:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-16 11:15:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-16 11:15:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-16 11:15:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 62 transitions. [2020-10-16 11:15:50,286 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 62 transitions. Word has length 16 [2020-10-16 11:15:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:50,286 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 62 transitions. [2020-10-16 11:15:50,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:15:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 62 transitions. [2020-10-16 11:15:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:15:50,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:50,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:50,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 11:15:50,287 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash -285431053, now seen corresponding path program 3 times [2020-10-16 11:15:50,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:50,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54144132] [2020-10-16 11:15:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:15:50,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54144132] [2020-10-16 11:15:50,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:50,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:15:50,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269196397] [2020-10-16 11:15:50,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:15:50,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:15:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:15:50,647 INFO L87 Difference]: Start difference. First operand 39 states and 62 transitions. Second operand 10 states. [2020-10-16 11:15:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:50,775 INFO L93 Difference]: Finished difference Result 35 states and 54 transitions. [2020-10-16 11:15:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:50,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-16 11:15:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:50,776 INFO L225 Difference]: With dead ends: 35 [2020-10-16 11:15:50,776 INFO L226 Difference]: Without dead ends: 0 [2020-10-16 11:15:50,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:15:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-16 11:15:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-16 11:15:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-16 11:15:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-16 11:15:50,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-10-16 11:15:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:50,778 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-16 11:15:50,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:15:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-16 11:15:50,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-16 11:15:50,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 11:15:50,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:15:50 BasicIcfg [2020-10-16 11:15:50,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:15:50,783 INFO L168 Benchmark]: Toolchain (without parser) took 20821.83 ms. Allocated memory was 138.4 MB in the beginning and 506.5 MB in the end (delta: 368.1 MB). Free memory was 99.2 MB in the beginning and 246.1 MB in the end (delta: -146.8 MB). Peak memory consumption was 221.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:50,784 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 11:15:50,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 929.37 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 99.0 MB in the beginning and 149.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:50,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.18 ms. Allocated memory is still 200.8 MB. Free memory was 149.9 MB in the beginning and 146.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:50,786 INFO L168 Benchmark]: Boogie Preprocessor took 82.28 ms. Allocated memory is still 200.8 MB. Free memory was 146.4 MB in the beginning and 143.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:50,787 INFO L168 Benchmark]: RCFGBuilder took 3755.67 ms. Allocated memory was 200.8 MB in the beginning and 252.2 MB in the end (delta: 51.4 MB). Free memory was 143.0 MB in the beginning and 104.0 MB in the end (delta: 39.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:50,787 INFO L168 Benchmark]: TraceAbstraction took 15968.09 ms. Allocated memory was 252.2 MB in the beginning and 506.5 MB in the end (delta: 254.3 MB). Free memory was 104.0 MB in the beginning and 246.1 MB in the end (delta: -142.1 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:50,790 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 929.37 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 99.0 MB in the beginning and 149.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.18 ms. Allocated memory is still 200.8 MB. Free memory was 149.9 MB in the beginning and 146.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.28 ms. Allocated memory is still 200.8 MB. Free memory was 146.4 MB in the beginning and 143.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3755.67 ms. Allocated memory was 200.8 MB in the beginning and 252.2 MB in the end (delta: 51.4 MB). Free memory was 143.0 MB in the beginning and 104.0 MB in the end (delta: 39.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15968.09 ms. Allocated memory was 252.2 MB in the beginning and 506.5 MB in the end (delta: 254.3 MB). Free memory was 104.0 MB in the beginning and 246.1 MB in the end (delta: -142.1 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 616 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.7s, 85 PlacesBefore, 29 PlacesAfterwards, 80 TransitionsBefore, 23 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 3006 MoverChecksTotal - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: 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, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 405 SDtfs, 539 SDslu, 1017 SDs, 0 SdLazy, 1306 SolverSat, 369 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred 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, 19 MinimizatonAttempts, 281 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 34153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...