/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:57:43,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:57:43,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:57:43,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:57:43,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:57:43,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:57:43,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:57:43,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:57:43,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:57:43,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:57:43,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:57:43,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:57:43,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:57:43,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:57:43,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:57:43,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:57:43,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:57:43,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:57:43,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:57:43,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:57:43,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:57:43,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:57:43,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:57:43,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:57:43,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:57:43,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:57:43,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:57:43,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:57:43,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:57:43,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:57:43,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:57:43,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:57:43,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:57:43,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:57:43,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:57:43,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:57:43,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:57:43,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:57:43,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:57:43,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:57:43,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:57:43,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 14:57:43,514 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:57:43,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:57:43,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:57:43,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:57:43,516 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:57:43,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:57:43,516 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:57:43,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:57:43,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:57:43,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:57:43,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:57:43,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:57:43,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:57:43,517 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:57:43,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:57:43,518 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:57:43,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:57:43,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:57:43,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:57:43,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:57:43,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:57:43,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:57:43,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:57:43,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:57:43,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:57:43,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:57:43,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:57:43,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:57:43,520 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:57:43,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:57:43,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:57:43,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:57:43,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:57:43,822 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:57:43,822 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:57:43,823 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2020-10-11 14:57:43,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ad64487/a83d705149db4eaa8ed08cb7400f4a07/FLAG2939bc647 [2020-10-11 14:57:44,470 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:57:44,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2020-10-11 14:57:44,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ad64487/a83d705149db4eaa8ed08cb7400f4a07/FLAG2939bc647 [2020-10-11 14:57:44,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ad64487/a83d705149db4eaa8ed08cb7400f4a07 [2020-10-11 14:57:44,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:57:44,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:57:44,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:57:44,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:57:44,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:57:44,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:44" (1/1) ... [2020-10-11 14:57:44,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4795cef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:44, skipping insertion in model container [2020-10-11 14:57:44,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:44" (1/1) ... [2020-10-11 14:57:44,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:57:44,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:57:45,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:57:45,373 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:57:45,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:57:45,524 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:57:45,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45 WrapperNode [2020-10-11 14:57:45,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:57:45,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:57:45,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:57:45,525 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:57:45,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:57:45,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:57:45,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:57:45,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:57:45,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... [2020-10-11 14:57:45,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:57:45,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:57:45,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:57:45,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:57:45,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:57:45,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:57:45,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:57:45,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:57:45,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:57:45,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:57:45,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:57:45,743 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:57:45,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:57:45,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:57:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:57:45,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:57:45,748 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 14:57:49,499 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:57:49,500 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:57:49,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:49 BoogieIcfgContainer [2020-10-11 14:57:49,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:57:49,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:57:49,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:57:49,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:57:49,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:57:44" (1/3) ... [2020-10-11 14:57:49,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db9ca91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:49, skipping insertion in model container [2020-10-11 14:57:49,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:45" (2/3) ... [2020-10-11 14:57:49,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db9ca91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:49, skipping insertion in model container [2020-10-11 14:57:49,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:49" (3/3) ... [2020-10-11 14:57:49,511 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2020-10-11 14:57:49,523 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:57:49,524 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:57:49,533 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:57:49,534 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:57:49,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,614 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,637 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,670 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,671 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,679 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,683 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:57:49,699 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 14:57:49,721 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:57:49,722 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:57:49,722 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:57:49,722 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:57:49,722 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:57:49,722 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:57:49,722 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:57:49,722 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:57:49,742 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:57:49,745 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-11 14:57:49,747 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-11 14:57:49,749 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-11 14:57:49,796 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-11 14:57:49,797 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:57:49,803 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-11 14:57:49,810 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-11 14:57:49,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:49,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:49,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:49,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:49,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:49,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:49,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:49,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:49,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:49,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:49,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:49,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:49,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:49,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:49,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:49,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:50,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:50,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:50,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,092 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-11 14:57:50,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,094 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-11 14:57:50,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:50,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,173 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-11 14:57:50,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,175 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-11 14:57:50,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:50,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:50,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:57:50,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:50,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:50,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,703 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-11 14:57:50,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,704 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-11 14:57:50,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:50,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:50,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:50,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:50,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:50,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:50,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:50,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:50,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:50,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:50,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:50,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:50,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:51,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:51,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:51,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:51,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:51,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,064 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-11 14:57:51,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,066 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-11 14:57:51,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,358 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-11 14:57:51,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:51,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:51,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:51,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:51,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:51,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,556 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-11 14:57:51,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,558 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-11 14:57:51,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,678 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-11 14:57:51,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,681 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-11 14:57:51,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,684 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-11 14:57:51,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:51,688 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-11 14:57:51,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:51,690 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-11 14:57:51,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:51,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,700 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-11 14:57:51,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,702 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-11 14:57:51,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:51,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,815 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-11 14:57:51,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,816 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-11 14:57:51,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,818 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-11 14:57:51,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,820 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-11 14:57:51,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:51,823 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-11 14:57:51,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:51,825 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-11 14:57:51,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:51,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:51,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,829 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-11 14:57:51,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,831 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-11 14:57:51,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:51,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:51,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:51,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:51,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:52,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-11 14:57:52,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,305 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-11 14:57:52,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,307 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-11 14:57:52,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,308 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-11 14:57:52,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,311 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-11 14:57:52,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:52,314 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-11 14:57:52,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:52,315 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-11 14:57:52,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:52,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:52,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,320 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-11 14:57:52,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,322 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-11 14:57:52,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:52,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,410 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-11 14:57:52,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,411 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-11 14:57:52,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,413 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-11 14:57:52,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,414 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-11 14:57:52,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,417 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-11 14:57:52,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:52,420 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-11 14:57:52,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:52,422 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-11 14:57:52,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:57:52,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:52,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,426 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-11 14:57:52,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,428 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-11 14:57:52,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:52,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:52,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:52,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:52,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:52,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,495 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-11 14:57:52,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:52,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:52,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:52,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:52,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:52,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:52,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:52,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:52,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,682 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-11 14:57:52,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,683 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-11 14:57:52,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:52,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:52,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:52,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:52,975 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-11 14:57:53,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:53,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:53,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:53,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:57:53,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:53,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:53,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:53,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:53,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-11 14:57:53,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:53,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-11 14:57:53,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:53,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:53,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:57:53,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:57:53,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:53,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:57:53,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:57:53,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:53,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:57:53,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:57:53,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:53,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:53,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:57:53,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:53,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:57:53,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:57:53,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:57:53,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:53,399 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-11 14:57:53,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:53,402 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-11 14:57:53,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:57:54,170 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-11 14:57:54,276 INFO L132 LiptonReduction]: Checked pairs total: 3006 [2020-10-11 14:57:54,276 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-11 14:57:54,289 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-10-11 14:57:54,325 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 266 states. [2020-10-11 14:57:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2020-10-11 14:57:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-11 14:57:54,336 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:54,337 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-11 14:57:54,337 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-11 14:57:54,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:54,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080409428] [2020-10-11 14:57:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:54,577 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-11 14:57:54,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080409428] [2020-10-11 14:57:54,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:54,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:57:54,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205568467] [2020-10-11 14:57:54,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:57:54,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:54,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:57:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:57:54,602 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 3 states. [2020-10-11 14:57:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:54,713 INFO L93 Difference]: Finished difference Result 230 states and 564 transitions. [2020-10-11 14:57:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:57:54,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-11 14:57:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:54,728 INFO L225 Difference]: With dead ends: 230 [2020-10-11 14:57:54,729 INFO L226 Difference]: Without dead ends: 194 [2020-10-11 14:57:54,730 INFO L673 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-11 14:57:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-11 14:57:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-11 14:57:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-11 14:57:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 468 transitions. [2020-10-11 14:57:54,783 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 468 transitions. Word has length 5 [2020-10-11 14:57:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:54,784 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 468 transitions. [2020-10-11 14:57:54,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:57:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 468 transitions. [2020-10-11 14:57:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-11 14:57:54,785 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:54,785 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:54,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:57:54,786 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-11 14:57:54,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:54,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254735665] [2020-10-11 14:57:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:54,984 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-11 14:57:54,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254735665] [2020-10-11 14:57:54,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:54,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:57:54,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591551633] [2020-10-11 14:57:54,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:57:54,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:54,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:57:54,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:57:54,988 INFO L87 Difference]: Start difference. First operand 194 states and 468 transitions. Second operand 4 states. [2020-10-11 14:57:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:55,042 INFO L93 Difference]: Finished difference Result 194 states and 444 transitions. [2020-10-11 14:57:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:57:55,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-11 14:57:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:55,045 INFO L225 Difference]: With dead ends: 194 [2020-10-11 14:57:55,045 INFO L226 Difference]: Without dead ends: 158 [2020-10-11 14:57:55,046 INFO L673 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-11 14:57:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-11 14:57:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-10-11 14:57:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-11 14:57:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 366 transitions. [2020-10-11 14:57:55,067 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 366 transitions. Word has length 8 [2020-10-11 14:57:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:55,067 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 366 transitions. [2020-10-11 14:57:55,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:57:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 366 transitions. [2020-10-11 14:57:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 14:57:55,069 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:55,069 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:55,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:57:55,069 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1593199242, now seen corresponding path program 1 times [2020-10-11 14:57:55,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:55,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552894685] [2020-10-11 14:57:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:55,321 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-11 14:57:55,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552894685] [2020-10-11 14:57:55,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:55,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:57:55,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580940527] [2020-10-11 14:57:55,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:57:55,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:57:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:57:55,324 INFO L87 Difference]: Start difference. First operand 158 states and 366 transitions. Second operand 4 states. [2020-10-11 14:57:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:55,369 INFO L93 Difference]: Finished difference Result 164 states and 367 transitions. [2020-10-11 14:57:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:57:55,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-11 14:57:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:55,372 INFO L225 Difference]: With dead ends: 164 [2020-10-11 14:57:55,373 INFO L226 Difference]: Without dead ends: 146 [2020-10-11 14:57:55,373 INFO L673 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-11 14:57:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-10-11 14:57:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2020-10-11 14:57:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-11 14:57:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 334 transitions. [2020-10-11 14:57:55,382 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 334 transitions. Word has length 11 [2020-10-11 14:57:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:55,383 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 334 transitions. [2020-10-11 14:57:55,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:57:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 334 transitions. [2020-10-11 14:57:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:57:55,384 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:55,385 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:55,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:57:55,385 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2054367808, now seen corresponding path program 1 times [2020-10-11 14:57:55,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:55,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960667069] [2020-10-11 14:57:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:55,704 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-11 14:57:55,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960667069] [2020-10-11 14:57:55,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:55,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:57:55,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313777859] [2020-10-11 14:57:55,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:57:55,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:57:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:55,708 INFO L87 Difference]: Start difference. First operand 146 states and 334 transitions. Second operand 9 states. [2020-10-11 14:57:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:56,183 INFO L93 Difference]: Finished difference Result 192 states and 429 transitions. [2020-10-11 14:57:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 14:57:56,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-11 14:57:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:56,188 INFO L225 Difference]: With dead ends: 192 [2020-10-11 14:57:56,188 INFO L226 Difference]: Without dead ends: 178 [2020-10-11 14:57:56,188 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-11 14:57:56,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-10-11 14:57:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2020-10-11 14:57:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-11 14:57:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 381 transitions. [2020-10-11 14:57:56,200 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 381 transitions. Word has length 13 [2020-10-11 14:57:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:56,200 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 381 transitions. [2020-10-11 14:57:56,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:57:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 381 transitions. [2020-10-11 14:57:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:57:56,202 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:56,202 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:56,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:57:56,202 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2058692308, now seen corresponding path program 2 times [2020-10-11 14:57:56,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:56,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878694184] [2020-10-11 14:57:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:56,478 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-11 14:57:56,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878694184] [2020-10-11 14:57:56,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:56,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:57:56,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674370507] [2020-10-11 14:57:56,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:57:56,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:56,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:57:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:56,480 INFO L87 Difference]: Start difference. First operand 167 states and 381 transitions. Second operand 9 states. [2020-10-11 14:57:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:57,021 INFO L93 Difference]: Finished difference Result 200 states and 449 transitions. [2020-10-11 14:57:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 14:57:57,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-11 14:57:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:57,027 INFO L225 Difference]: With dead ends: 200 [2020-10-11 14:57:57,027 INFO L226 Difference]: Without dead ends: 185 [2020-10-11 14:57:57,028 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-10-11 14:57:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-11 14:57:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 170. [2020-10-11 14:57:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-11 14:57:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 392 transitions. [2020-10-11 14:57:57,036 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 392 transitions. Word has length 13 [2020-10-11 14:57:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:57,037 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 392 transitions. [2020-10-11 14:57:57,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:57:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 392 transitions. [2020-10-11 14:57:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:57:57,039 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:57,039 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:57,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:57:57,039 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -102986176, now seen corresponding path program 3 times [2020-10-11 14:57:57,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:57,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433861508] [2020-10-11 14:57:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:57,293 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-11 14:57:57,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433861508] [2020-10-11 14:57:57,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:57,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:57:57,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920183439] [2020-10-11 14:57:57,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:57:57,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:57,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:57:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:57:57,296 INFO L87 Difference]: Start difference. First operand 170 states and 392 transitions. Second operand 8 states. [2020-10-11 14:57:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:57,660 INFO L93 Difference]: Finished difference Result 207 states and 470 transitions. [2020-10-11 14:57:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 14:57:57,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-11 14:57:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:57,663 INFO L225 Difference]: With dead ends: 207 [2020-10-11 14:57:57,663 INFO L226 Difference]: Without dead ends: 192 [2020-10-11 14:57:57,664 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-10-11 14:57:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-11 14:57:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 165. [2020-10-11 14:57:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-10-11 14:57:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 375 transitions. [2020-10-11 14:57:57,679 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 375 transitions. Word has length 13 [2020-10-11 14:57:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:57,679 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 375 transitions. [2020-10-11 14:57:57,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:57:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 375 transitions. [2020-10-11 14:57:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:57:57,684 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:57,684 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:57,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:57:57,684 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -740690617, now seen corresponding path program 1 times [2020-10-11 14:57:57,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:57,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786967191] [2020-10-11 14:57:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:57,891 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-11 14:57:57,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786967191] [2020-10-11 14:57:57,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:57,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:57:57,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030185063] [2020-10-11 14:57:57,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:57:57,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:57:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:57:57,894 INFO L87 Difference]: Start difference. First operand 165 states and 375 transitions. Second operand 6 states. [2020-10-11 14:57:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:58,129 INFO L93 Difference]: Finished difference Result 203 states and 462 transitions. [2020-10-11 14:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:57:58,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-11 14:57:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:58,133 INFO L225 Difference]: With dead ends: 203 [2020-10-11 14:57:58,133 INFO L226 Difference]: Without dead ends: 192 [2020-10-11 14:57:58,134 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:57:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-11 14:57:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 177. [2020-10-11 14:57:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-11 14:57:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 404 transitions. [2020-10-11 14:57:58,141 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 404 transitions. Word has length 14 [2020-10-11 14:57:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:58,142 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 404 transitions. [2020-10-11 14:57:58,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:57:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 404 transitions. [2020-10-11 14:57:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:57:58,143 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:58,144 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:58,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:57:58,144 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash -740958736, now seen corresponding path program 1 times [2020-10-11 14:57:58,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:58,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911666187] [2020-10-11 14:57:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:58,711 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-11 14:57:58,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911666187] [2020-10-11 14:57:58,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:58,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:57:58,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920837727] [2020-10-11 14:57:58,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:57:58,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:58,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:57:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:57:58,713 INFO L87 Difference]: Start difference. First operand 177 states and 404 transitions. Second operand 10 states. [2020-10-11 14:57:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:59,063 INFO L93 Difference]: Finished difference Result 197 states and 442 transitions. [2020-10-11 14:57:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:57:59,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-10-11 14:57:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:59,068 INFO L225 Difference]: With dead ends: 197 [2020-10-11 14:57:59,068 INFO L226 Difference]: Without dead ends: 189 [2020-10-11 14:57:59,069 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-11 14:57:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-11 14:57:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2020-10-11 14:57:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-10-11 14:57:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 430 transitions. [2020-10-11 14:57:59,075 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 430 transitions. Word has length 14 [2020-10-11 14:57:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:59,076 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 430 transitions. [2020-10-11 14:57:59,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:57:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 430 transitions. [2020-10-11 14:57:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:57:59,077 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:59,077 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:59,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:57:59,077 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:59,077 INFO L82 PathProgramCache]: Analyzing trace with hash 666069347, now seen corresponding path program 2 times [2020-10-11 14:57:59,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:59,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312267337] [2020-10-11 14:57:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:57:59,447 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-11 14:57:59,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312267337] [2020-10-11 14:57:59,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:57:59,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:57:59,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978414732] [2020-10-11 14:57:59,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:57:59,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:57:59,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:57:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:57:59,450 INFO L87 Difference]: Start difference. First operand 189 states and 430 transitions. Second operand 10 states. [2020-10-11 14:57:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:57:59,882 INFO L93 Difference]: Finished difference Result 250 states and 572 transitions. [2020-10-11 14:57:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 14:57:59,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-10-11 14:57:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:57:59,885 INFO L225 Difference]: With dead ends: 250 [2020-10-11 14:57:59,886 INFO L226 Difference]: Without dead ends: 237 [2020-10-11 14:57:59,886 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-10-11 14:57:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-10-11 14:57:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 189. [2020-10-11 14:57:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-10-11 14:57:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 436 transitions. [2020-10-11 14:57:59,897 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 436 transitions. Word has length 14 [2020-10-11 14:57:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:57:59,898 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 436 transitions. [2020-10-11 14:57:59,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:57:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 436 transitions. [2020-10-11 14:57:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:57:59,899 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:57:59,900 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:57:59,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:57:59,900 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:57:59,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:57:59,901 INFO L82 PathProgramCache]: Analyzing trace with hash -451718173, now seen corresponding path program 3 times [2020-10-11 14:57:59,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:57:59,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514923657] [2020-10-11 14:57:59,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:57:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:00,233 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-11 14:58:00,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514923657] [2020-10-11 14:58:00,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:00,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:58:00,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968971518] [2020-10-11 14:58:00,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:58:00,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:58:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:58:00,236 INFO L87 Difference]: Start difference. First operand 189 states and 436 transitions. Second operand 9 states. [2020-10-11 14:58:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:00,950 INFO L93 Difference]: Finished difference Result 317 states and 704 transitions. [2020-10-11 14:58:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 14:58:00,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-11 14:58:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:00,953 INFO L225 Difference]: With dead ends: 317 [2020-10-11 14:58:00,953 INFO L226 Difference]: Without dead ends: 281 [2020-10-11 14:58:00,953 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-10-11 14:58:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-10-11 14:58:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 184. [2020-10-11 14:58:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-11 14:58:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 413 transitions. [2020-10-11 14:58:00,960 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 413 transitions. Word has length 14 [2020-10-11 14:58:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:00,960 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 413 transitions. [2020-10-11 14:58:00,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:58:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 413 transitions. [2020-10-11 14:58:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:58:00,961 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:00,961 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:00,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 14:58:00,962 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash -451986292, now seen corresponding path program 2 times [2020-10-11 14:58:00,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:00,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171914120] [2020-10-11 14:58:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:01,320 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-11 14:58:01,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171914120] [2020-10-11 14:58:01,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:01,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:58:01,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417190905] [2020-10-11 14:58:01,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:58:01,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:58:01,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:58:01,323 INFO L87 Difference]: Start difference. First operand 184 states and 413 transitions. Second operand 8 states. [2020-10-11 14:58:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:01,640 INFO L93 Difference]: Finished difference Result 239 states and 524 transitions. [2020-10-11 14:58:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:58:01,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-11 14:58:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:01,642 INFO L225 Difference]: With dead ends: 239 [2020-10-11 14:58:01,642 INFO L226 Difference]: Without dead ends: 171 [2020-10-11 14:58:01,643 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-11 14:58:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-11 14:58:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2020-10-11 14:58:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-10-11 14:58:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 372 transitions. [2020-10-11 14:58:01,650 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 372 transitions. Word has length 14 [2020-10-11 14:58:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:01,652 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 372 transitions. [2020-10-11 14:58:01,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:58:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 372 transitions. [2020-10-11 14:58:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:01,653 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:01,653 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:01,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 14:58:01,654 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1488126081, now seen corresponding path program 1 times [2020-10-11 14:58:01,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:01,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257833407] [2020-10-11 14:58:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:01,769 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-11 14:58:01,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257833407] [2020-10-11 14:58:01,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:01,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:58:01,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648548350] [2020-10-11 14:58:01,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:58:01,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:01,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:58:01,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:58:01,771 INFO L87 Difference]: Start difference. First operand 165 states and 372 transitions. Second operand 5 states. [2020-10-11 14:58:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:01,898 INFO L93 Difference]: Finished difference Result 258 states and 573 transitions. [2020-10-11 14:58:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:58:01,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-11 14:58:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:01,901 INFO L225 Difference]: With dead ends: 258 [2020-10-11 14:58:01,901 INFO L226 Difference]: Without dead ends: 175 [2020-10-11 14:58:01,901 INFO L673 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-11 14:58:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-11 14:58:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2020-10-11 14:58:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-10-11 14:58:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 373 transitions. [2020-10-11 14:58:01,910 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 373 transitions. Word has length 15 [2020-10-11 14:58:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:01,911 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 373 transitions. [2020-10-11 14:58:01,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:58:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 373 transitions. [2020-10-11 14:58:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:01,912 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:01,912 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:01,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 14:58:01,913 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1436491551, now seen corresponding path program 2 times [2020-10-11 14:58:01,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:01,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443213163] [2020-10-11 14:58:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:02,134 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-11 14:58:02,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443213163] [2020-10-11 14:58:02,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:02,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:58:02,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977414529] [2020-10-11 14:58:02,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:58:02,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:02,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:58:02,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:58:02,138 INFO L87 Difference]: Start difference. First operand 175 states and 373 transitions. Second operand 8 states. [2020-10-11 14:58:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:02,508 INFO L93 Difference]: Finished difference Result 229 states and 475 transitions. [2020-10-11 14:58:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 14:58:02,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-11 14:58:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:02,510 INFO L225 Difference]: With dead ends: 229 [2020-10-11 14:58:02,510 INFO L226 Difference]: Without dead ends: 189 [2020-10-11 14:58:02,510 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-11 14:58:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-11 14:58:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2020-10-11 14:58:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-10-11 14:58:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 372 transitions. [2020-10-11 14:58:02,517 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 372 transitions. Word has length 15 [2020-10-11 14:58:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:02,518 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 372 transitions. [2020-10-11 14:58:02,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:58:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 372 transitions. [2020-10-11 14:58:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:02,518 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:02,519 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:02,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 14:58:02,519 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash -828240157, now seen corresponding path program 3 times [2020-10-11 14:58:02,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:02,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565687843] [2020-10-11 14:58:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:02,874 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-11 14:58:02,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565687843] [2020-10-11 14:58:02,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:02,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:58:02,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031528738] [2020-10-11 14:58:02,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:58:02,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:02,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:58:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:58:02,879 INFO L87 Difference]: Start difference. First operand 175 states and 372 transitions. Second operand 10 states. [2020-10-11 14:58:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:03,325 INFO L93 Difference]: Finished difference Result 232 states and 489 transitions. [2020-10-11 14:58:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 14:58:03,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-11 14:58:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:03,327 INFO L225 Difference]: With dead ends: 232 [2020-10-11 14:58:03,327 INFO L226 Difference]: Without dead ends: 197 [2020-10-11 14:58:03,328 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-10-11 14:58:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-10-11 14:58:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2020-10-11 14:58:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-11 14:58:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 388 transitions. [2020-10-11 14:58:03,334 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 388 transitions. Word has length 15 [2020-10-11 14:58:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:03,334 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 388 transitions. [2020-10-11 14:58:03,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:58:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 388 transitions. [2020-10-11 14:58:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:03,335 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:03,335 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:03,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 14:58:03,335 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -776605627, now seen corresponding path program 4 times [2020-10-11 14:58:03,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:03,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416635539] [2020-10-11 14:58:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:03,643 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-11 14:58:03,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416635539] [2020-10-11 14:58:03,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:03,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:58:03,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398048875] [2020-10-11 14:58:03,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:58:03,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:58:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:58:03,646 INFO L87 Difference]: Start difference. First operand 183 states and 388 transitions. Second operand 10 states. [2020-10-11 14:58:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:04,053 INFO L93 Difference]: Finished difference Result 233 states and 476 transitions. [2020-10-11 14:58:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 14:58:04,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-11 14:58:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:04,056 INFO L225 Difference]: With dead ends: 233 [2020-10-11 14:58:04,056 INFO L226 Difference]: Without dead ends: 194 [2020-10-11 14:58:04,057 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-10-11 14:58:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-11 14:58:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2020-10-11 14:58:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-11 14:58:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 374 transitions. [2020-10-11 14:58:04,062 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 374 transitions. Word has length 15 [2020-10-11 14:58:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:04,063 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 374 transitions. [2020-10-11 14:58:04,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:58:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 374 transitions. [2020-10-11 14:58:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:04,064 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:04,064 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:04,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 14:58:04,064 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1060903253, now seen corresponding path program 5 times [2020-10-11 14:58:04,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:04,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530146010] [2020-10-11 14:58:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:04,369 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-11 14:58:04,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530146010] [2020-10-11 14:58:04,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:04,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:58:04,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509316052] [2020-10-11 14:58:04,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:58:04,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:58:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:58:04,371 INFO L87 Difference]: Start difference. First operand 177 states and 374 transitions. Second operand 10 states. [2020-10-11 14:58:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:04,839 INFO L93 Difference]: Finished difference Result 231 states and 484 transitions. [2020-10-11 14:58:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 14:58:04,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-11 14:58:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:04,841 INFO L225 Difference]: With dead ends: 231 [2020-10-11 14:58:04,842 INFO L226 Difference]: Without dead ends: 196 [2020-10-11 14:58:04,842 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-10-11 14:58:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-10-11 14:58:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2020-10-11 14:58:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-11 14:58:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 386 transitions. [2020-10-11 14:58:04,848 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 386 transitions. Word has length 15 [2020-10-11 14:58:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:04,849 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 386 transitions. [2020-10-11 14:58:04,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:58:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 386 transitions. [2020-10-11 14:58:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:04,850 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:04,850 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:04,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 14:58:04,850 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1034126573, now seen corresponding path program 6 times [2020-10-11 14:58:04,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:04,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13000590] [2020-10-11 14:58:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:05,189 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-11 14:58:05,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13000590] [2020-10-11 14:58:05,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:05,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 14:58:05,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278945864] [2020-10-11 14:58:05,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 14:58:05,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 14:58:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:58:05,191 INFO L87 Difference]: Start difference. First operand 184 states and 386 transitions. Second operand 10 states. [2020-10-11 14:58:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:05,496 INFO L93 Difference]: Finished difference Result 261 states and 535 transitions. [2020-10-11 14:58:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 14:58:05,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-11 14:58:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:05,497 INFO L225 Difference]: With dead ends: 261 [2020-10-11 14:58:05,497 INFO L226 Difference]: Without dead ends: 152 [2020-10-11 14:58:05,498 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-11 14:58:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-11 14:58:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2020-10-11 14:58:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-11 14:58:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 281 transitions. [2020-10-11 14:58:05,503 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 281 transitions. Word has length 15 [2020-10-11 14:58:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:05,503 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 281 transitions. [2020-10-11 14:58:05,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 14:58:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 281 transitions. [2020-10-11 14:58:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:05,504 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:05,504 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:05,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 14:58:05,504 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1644105373, now seen corresponding path program 7 times [2020-10-11 14:58:05,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:05,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504045589] [2020-10-11 14:58:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:05,844 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-11 14:58:05,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504045589] [2020-10-11 14:58:05,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:05,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 14:58:05,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877729910] [2020-10-11 14:58:05,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 14:58:05,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 14:58:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 14:58:05,846 INFO L87 Difference]: Start difference. First operand 140 states and 281 transitions. Second operand 11 states. [2020-10-11 14:58:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:06,688 INFO L93 Difference]: Finished difference Result 201 states and 389 transitions. [2020-10-11 14:58:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 14:58:06,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2020-10-11 14:58:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:06,691 INFO L225 Difference]: With dead ends: 201 [2020-10-11 14:58:06,691 INFO L226 Difference]: Without dead ends: 164 [2020-10-11 14:58:06,692 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2020-10-11 14:58:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-10-11 14:58:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 128. [2020-10-11 14:58:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-11 14:58:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 253 transitions. [2020-10-11 14:58:06,696 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 253 transitions. Word has length 15 [2020-10-11 14:58:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:06,697 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 253 transitions. [2020-10-11 14:58:06,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 14:58:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 253 transitions. [2020-10-11 14:58:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:06,698 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:06,698 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:06,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 14:58:06,699 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash -931905961, now seen corresponding path program 8 times [2020-10-11 14:58:06,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:06,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770014840] [2020-10-11 14:58:06,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:06,908 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-11 14:58:06,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770014840] [2020-10-11 14:58:06,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:06,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:58:06,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835110515] [2020-10-11 14:58:06,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:58:06,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:06,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:58:06,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:58:06,910 INFO L87 Difference]: Start difference. First operand 128 states and 253 transitions. Second operand 8 states. [2020-10-11 14:58:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:07,223 INFO L93 Difference]: Finished difference Result 156 states and 304 transitions. [2020-10-11 14:58:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:58:07,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-11 14:58:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:07,225 INFO L225 Difference]: With dead ends: 156 [2020-10-11 14:58:07,225 INFO L226 Difference]: Without dead ends: 121 [2020-10-11 14:58:07,226 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-11 14:58:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-11 14:58:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2020-10-11 14:58:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-11 14:58:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 226 transitions. [2020-10-11 14:58:07,231 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 226 transitions. Word has length 15 [2020-10-11 14:58:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:07,231 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 226 transitions. [2020-10-11 14:58:07,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:58:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 226 transitions. [2020-10-11 14:58:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:07,232 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:07,232 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:07,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 14:58:07,233 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash -782286779, now seen corresponding path program 9 times [2020-10-11 14:58:07,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:07,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601747548] [2020-10-11 14:58:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:07,407 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-11 14:58:07,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601747548] [2020-10-11 14:58:07,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:07,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:58:07,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880274083] [2020-10-11 14:58:07,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:58:07,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:07,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:58:07,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:58:07,410 INFO L87 Difference]: Start difference. First operand 119 states and 226 transitions. Second operand 7 states. [2020-10-11 14:58:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:07,805 INFO L93 Difference]: Finished difference Result 160 states and 289 transitions. [2020-10-11 14:58:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:58:07,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 14:58:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:07,806 INFO L225 Difference]: With dead ends: 160 [2020-10-11 14:58:07,806 INFO L226 Difference]: Without dead ends: 97 [2020-10-11 14:58:07,806 INFO L673 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-11 14:58:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-11 14:58:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2020-10-11 14:58:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-11 14:58:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 134 transitions. [2020-10-11 14:58:07,811 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 134 transitions. Word has length 15 [2020-10-11 14:58:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:07,811 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 134 transitions. [2020-10-11 14:58:07,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:58:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 134 transitions. [2020-10-11 14:58:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:58:07,813 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:07,814 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:07,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 14:58:07,814 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:07,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:07,815 INFO L82 PathProgramCache]: Analyzing trace with hash 65265109, now seen corresponding path program 10 times [2020-10-11 14:58:07,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:07,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206544017] [2020-10-11 14:58:07,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:08,001 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-11 14:58:08,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206544017] [2020-10-11 14:58:08,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:08,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:58:08,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485307717] [2020-10-11 14:58:08,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:58:08,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:58:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:58:08,004 INFO L87 Difference]: Start difference. First operand 79 states and 134 transitions. Second operand 7 states. [2020-10-11 14:58:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:08,172 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2020-10-11 14:58:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:58:08,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 14:58:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:08,174 INFO L225 Difference]: With dead ends: 97 [2020-10-11 14:58:08,174 INFO L226 Difference]: Without dead ends: 67 [2020-10-11 14:58:08,174 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:58:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-11 14:58:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2020-10-11 14:58:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-11 14:58:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 101 transitions. [2020-10-11 14:58:08,177 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 101 transitions. Word has length 15 [2020-10-11 14:58:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:08,177 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 101 transitions. [2020-10-11 14:58:08,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:58:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 101 transitions. [2020-10-11 14:58:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 14:58:08,178 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:08,178 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:08,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 14:58:08,178 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1589874385, now seen corresponding path program 1 times [2020-10-11 14:58:08,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:08,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485834522] [2020-10-11 14:58:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:08,339 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-11 14:58:08,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485834522] [2020-10-11 14:58:08,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:08,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:58:08,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184738176] [2020-10-11 14:58:08,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:58:08,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:08,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:58:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:58:08,341 INFO L87 Difference]: Start difference. First operand 61 states and 101 transitions. Second operand 8 states. [2020-10-11 14:58:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:08,572 INFO L93 Difference]: Finished difference Result 83 states and 134 transitions. [2020-10-11 14:58:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:58:08,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-11 14:58:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:08,573 INFO L225 Difference]: With dead ends: 83 [2020-10-11 14:58:08,573 INFO L226 Difference]: Without dead ends: 46 [2020-10-11 14:58:08,574 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-11 14:58:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-11 14:58:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-10-11 14:58:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-11 14:58:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 72 transitions. [2020-10-11 14:58:08,576 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 72 transitions. Word has length 16 [2020-10-11 14:58:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:08,576 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 72 transitions. [2020-10-11 14:58:08,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:58:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 72 transitions. [2020-10-11 14:58:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 14:58:08,577 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:58:08,577 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:58:08,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 14:58:08,577 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:58:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:58:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1686720075, now seen corresponding path program 2 times [2020-10-11 14:58:08,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:58:08,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996392481] [2020-10-11 14:58:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:58:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:58:08,847 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-11 14:58:08,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996392481] [2020-10-11 14:58:08,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:58:08,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:58:08,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23845173] [2020-10-11 14:58:08,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:58:08,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:58:08,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:58:08,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:58:08,850 INFO L87 Difference]: Start difference. First operand 44 states and 72 transitions. Second operand 9 states. [2020-10-11 14:58:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:58:09,041 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2020-10-11 14:58:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 14:58:09,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-11 14:58:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:58:09,042 INFO L225 Difference]: With dead ends: 40 [2020-10-11 14:58:09,042 INFO L226 Difference]: Without dead ends: 0 [2020-10-11 14:58:09,042 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-11 14:58:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-11 14:58:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-11 14:58:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-11 14:58:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-11 14:58:09,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-10-11 14:58:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:58:09,043 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-11 14:58:09,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:58:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-11 14:58:09,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-11 14:58:09,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 14:58:09,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:58:09 BasicIcfg [2020-10-11 14:58:09,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:58:09,049 INFO L168 Benchmark]: Toolchain (without parser) took 24326.82 ms. Allocated memory was 251.1 MB in the beginning and 689.4 MB in the end (delta: 438.3 MB). Free memory was 206.3 MB in the beginning and 436.7 MB in the end (delta: -230.4 MB). Peak memory consumption was 207.9 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:09,049 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:58:09,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.01 ms. Allocated memory was 251.1 MB in the beginning and 312.0 MB in the end (delta: 60.8 MB). Free memory was 206.3 MB in the beginning and 260.0 MB in the end (delta: -53.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:09,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.64 ms. Allocated memory is still 312.0 MB. Free memory was 260.0 MB in the beginning and 254.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:09,051 INFO L168 Benchmark]: Boogie Preprocessor took 47.70 ms. Allocated memory is still 312.0 MB. Free memory was 254.9 MB in the beginning and 252.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:09,051 INFO L168 Benchmark]: RCFGBuilder took 3858.33 ms. Allocated memory was 312.0 MB in the beginning and 370.1 MB in the end (delta: 58.2 MB). Free memory was 252.4 MB in the beginning and 162.8 MB in the end (delta: 89.6 MB). Peak memory consumption was 147.8 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:09,052 INFO L168 Benchmark]: TraceAbstraction took 19543.62 ms. Allocated memory was 370.1 MB in the beginning and 689.4 MB in the end (delta: 319.3 MB). Free memory was 162.8 MB in the beginning and 436.7 MB in the end (delta: -273.9 MB). Peak memory consumption was 45.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:58:09,055 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.21 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 801.01 ms. Allocated memory was 251.1 MB in the beginning and 312.0 MB in the end (delta: 60.8 MB). Free memory was 206.3 MB in the beginning and 260.0 MB in the end (delta: -53.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.64 ms. Allocated memory is still 312.0 MB. Free memory was 260.0 MB in the beginning and 254.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.70 ms. Allocated memory is still 312.0 MB. Free memory was 254.9 MB in the beginning and 252.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3858.33 ms. Allocated memory was 312.0 MB in the beginning and 370.1 MB in the end (delta: 58.2 MB). Free memory was 252.4 MB in the beginning and 162.8 MB in the end (delta: 89.6 MB). Peak memory consumption was 147.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 19543.62 ms. Allocated memory was 370.1 MB in the beginning and 689.4 MB in the end (delta: 319.3 MB). Free memory was 162.8 MB in the beginning and 436.7 MB in the end (delta: -273.9 MB). Peak memory consumption was 45.4 MB. Max. memory is 14.2 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.1s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 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: 19.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 450 SDtfs, 727 SDslu, 1361 SDs, 0 SdLazy, 1976 SolverSat, 610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 5.8s 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, 23 MinimizatonAttempts, 352 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 48985 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...