/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:18:42,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:18:42,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:18:42,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:18:42,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:18:42,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:18:42,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:18:42,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:18:42,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:18:42,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:18:42,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:18:42,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:18:42,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:18:42,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:18:42,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:18:42,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:18:42,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:18:42,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:18:42,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:18:42,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:18:42,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:18:42,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:18:42,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:18:42,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:18:42,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:18:42,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:18:42,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:18:42,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:18:42,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:18:42,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:18:42,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:18:42,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:18:42,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:18:42,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:18:42,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:18:42,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:18:42,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:18:42,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:18:42,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:18:42,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:18:42,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:18:42,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:18:42,552 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:18:42,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:18:42,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:18:42,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:18:42,559 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:18:42,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:18:42,559 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:18:42,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:18:42,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:18:42,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:18:42,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:18:42,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:18:42,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:18:42,560 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:18:42,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:18:42,561 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:18:42,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:18:42,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:18:42,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:18:42,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:18:42,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:18:42,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:18:42,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:18:42,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:18:42,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:18:42,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:18:42,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:18:42,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:18:42,565 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:18:42,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:18:42,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:18:42,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:18:42,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:18:42,915 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:18:42,917 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:18:42,918 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-10-16 11:18:42,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dbc8db270/16e1c96aaf8e4a7ea4f28c795c5f208a/FLAG57e5033fc [2020-10-16 11:18:43,553 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:18:43,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-10-16 11:18:43,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dbc8db270/16e1c96aaf8e4a7ea4f28c795c5f208a/FLAG57e5033fc [2020-10-16 11:18:43,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dbc8db270/16e1c96aaf8e4a7ea4f28c795c5f208a [2020-10-16 11:18:43,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:18:43,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:18:43,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:18:43,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:18:43,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:18:43,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:18:43" (1/1) ... [2020-10-16 11:18:43,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aabe850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:43, skipping insertion in model container [2020-10-16 11:18:43,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:18:43" (1/1) ... [2020-10-16 11:18:43,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:18:43,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:18:44,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:18:44,451 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:18:44,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:18:44,621 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:18:44,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44 WrapperNode [2020-10-16 11:18:44,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:18:44,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:18:44,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:18:44,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:18:44,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:18:44,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:18:44,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:18:44,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:18:44,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... [2020-10-16 11:18:44,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:18:44,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:18:44,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:18:44,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:18:44,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:18:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:18:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:18:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:18:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:18:44,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:18:44,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:18:44,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:18:44,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:18:44,837 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:18:44,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:18:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:18:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:18:44,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:18:44,840 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:18:46,956 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:18:46,957 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:18:46,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:18:46 BoogieIcfgContainer [2020-10-16 11:18:46,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:18:46,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:18:46,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:18:46,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:18:46,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:18:43" (1/3) ... [2020-10-16 11:18:46,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdfdd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:18:46, skipping insertion in model container [2020-10-16 11:18:46,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:44" (2/3) ... [2020-10-16 11:18:46,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdfdd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:18:46, skipping insertion in model container [2020-10-16 11:18:46,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:18:46" (3/3) ... [2020-10-16 11:18:46,968 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2020-10-16 11:18:46,980 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:18:46,981 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:18:46,988 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:18:46,989 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:18:47,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,020 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,020 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,024 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,026 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,026 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,033 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,034 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:47,045 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:18:47,059 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 11:18:47,080 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:18:47,081 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:18:47,081 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:18:47,081 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:18:47,081 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:18:47,081 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:18:47,081 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:18:47,082 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:18:47,096 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:18:47,099 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 11:18:47,102 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 11:18:47,104 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 11:18:47,149 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 11:18:47,150 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:18:47,154 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 11:18:47,158 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 11:18:47,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:18:47,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:47,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:47,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:47,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:47,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:47,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:47,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:47,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:47,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:47,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:47,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:47,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:47,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:47,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:48,183 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 11:18:48,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:48,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:48,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:48,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:48,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:48,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:48,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:48,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:48,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:48,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:48,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:48,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:48,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:48,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:48,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:48,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:48,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:48,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:18:48,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:18:48,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:18:48,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:18:48,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:18:48,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:18:48,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:18:48,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:18:48,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:48,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:48,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 11:18:48,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:18:48,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:18:48,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:49,816 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 11:18:49,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 11:18:49,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:49,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:49,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:50,613 WARN L193 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 11:18:50,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:18:50,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:51,105 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 11:18:51,246 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 11:18:51,815 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 11:18:51,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:18:51,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:51,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:51,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:51,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:51,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:51,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:51,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:51,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:51,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:51,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:51,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:51,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:51,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:51,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:51,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:51,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:51,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:52,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:52,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:52,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:52,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:52,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:52,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:52,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:53,128 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-10-16 11:18:53,340 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 11:18:53,451 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 11:18:53,459 INFO L132 LiptonReduction]: Checked pairs total: 4811 [2020-10-16 11:18:53,459 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-16 11:18:53,471 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-16 11:18:53,527 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-16 11:18:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-16 11:18:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 11:18:53,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:53,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 11:18:53,536 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1041180, now seen corresponding path program 1 times [2020-10-16 11:18:53,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:53,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798575324] [2020-10-16 11:18:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:53,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798575324] [2020-10-16 11:18:53,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:53,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:18:53,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14313623] [2020-10-16 11:18:53,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:18:53,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:18:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:18:53,774 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-16 11:18:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:53,858 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-16 11:18:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:18:53,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 11:18:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:53,884 INFO L225 Difference]: With dead ends: 812 [2020-10-16 11:18:53,884 INFO L226 Difference]: Without dead ends: 687 [2020-10-16 11:18:53,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:18:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-16 11:18:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-16 11:18:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-16 11:18:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-16 11:18:54,011 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-16 11:18:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:54,012 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-16 11:18:54,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:18:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-16 11:18:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 11:18:54,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:54,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:54,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:18:54,019 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 626468161, now seen corresponding path program 1 times [2020-10-16 11:18:54,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:54,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697827508] [2020-10-16 11:18:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:54,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697827508] [2020-10-16 11:18:54,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:54,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:18:54,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580489725] [2020-10-16 11:18:54,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:54,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:54,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:54,167 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-16 11:18:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:54,208 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-10-16 11:18:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:54,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 11:18:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:54,214 INFO L225 Difference]: With dead ends: 792 [2020-10-16 11:18:54,215 INFO L226 Difference]: Without dead ends: 667 [2020-10-16 11:18:54,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-10-16 11:18:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-10-16 11:18:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-10-16 11:18:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-10-16 11:18:54,240 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-10-16 11:18:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:54,241 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-10-16 11:18:54,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-10-16 11:18:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:18:54,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:54,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:54,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:18:54,244 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 254166472, now seen corresponding path program 1 times [2020-10-16 11:18:54,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:54,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862368510] [2020-10-16 11:18:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:54,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862368510] [2020-10-16 11:18:54,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:54,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:18:54,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20882583] [2020-10-16 11:18:54,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:54,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:54,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:54,360 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-10-16 11:18:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:54,456 INFO L93 Difference]: Finished difference Result 759 states and 2283 transitions. [2020-10-16 11:18:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:54,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 11:18:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:54,463 INFO L225 Difference]: With dead ends: 759 [2020-10-16 11:18:54,463 INFO L226 Difference]: Without dead ends: 659 [2020-10-16 11:18:54,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-16 11:18:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2020-10-16 11:18:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-10-16 11:18:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 2044 transitions. [2020-10-16 11:18:54,532 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 2044 transitions. Word has length 11 [2020-10-16 11:18:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:54,532 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 2044 transitions. [2020-10-16 11:18:54,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 2044 transitions. [2020-10-16 11:18:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:18:54,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:54,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:54,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:18:54,535 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash -731543524, now seen corresponding path program 1 times [2020-10-16 11:18:54,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:54,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462491024] [2020-10-16 11:18:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:54,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462491024] [2020-10-16 11:18:54,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:54,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:54,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919778566] [2020-10-16 11:18:54,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:54,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:54,681 INFO L87 Difference]: Start difference. First operand 659 states and 2044 transitions. Second operand 5 states. [2020-10-16 11:18:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:54,843 INFO L93 Difference]: Finished difference Result 767 states and 2325 transitions. [2020-10-16 11:18:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:54,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 11:18:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:54,854 INFO L225 Difference]: With dead ends: 767 [2020-10-16 11:18:54,854 INFO L226 Difference]: Without dead ends: 687 [2020-10-16 11:18:54,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-16 11:18:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-16 11:18:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-16 11:18:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2125 transitions. [2020-10-16 11:18:54,878 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2125 transitions. Word has length 12 [2020-10-16 11:18:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:54,880 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2125 transitions. [2020-10-16 11:18:54,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2125 transitions. [2020-10-16 11:18:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:18:54,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:54,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:54,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:18:54,886 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash -710778236, now seen corresponding path program 1 times [2020-10-16 11:18:54,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:54,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433900328] [2020-10-16 11:18:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:55,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433900328] [2020-10-16 11:18:55,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:55,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:55,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563789935] [2020-10-16 11:18:55,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:55,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:55,007 INFO L87 Difference]: Start difference. First operand 687 states and 2125 transitions. Second operand 6 states. [2020-10-16 11:18:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:55,141 INFO L93 Difference]: Finished difference Result 808 states and 2431 transitions. [2020-10-16 11:18:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:55,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-16 11:18:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:55,148 INFO L225 Difference]: With dead ends: 808 [2020-10-16 11:18:55,148 INFO L226 Difference]: Without dead ends: 713 [2020-10-16 11:18:55,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-10-16 11:18:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 697. [2020-10-16 11:18:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-10-16 11:18:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 2153 transitions. [2020-10-16 11:18:55,187 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 2153 transitions. Word has length 12 [2020-10-16 11:18:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:55,188 INFO L481 AbstractCegarLoop]: Abstraction has 697 states and 2153 transitions. [2020-10-16 11:18:55,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 2153 transitions. [2020-10-16 11:18:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:18:55,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:55,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:55,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:18:55,190 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash -711643136, now seen corresponding path program 2 times [2020-10-16 11:18:55,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:55,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244087189] [2020-10-16 11:18:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:55,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244087189] [2020-10-16 11:18:55,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:55,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:18:55,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599280552] [2020-10-16 11:18:55,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:55,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:55,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:55,306 INFO L87 Difference]: Start difference. First operand 697 states and 2153 transitions. Second operand 4 states. [2020-10-16 11:18:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:55,337 INFO L93 Difference]: Finished difference Result 754 states and 2259 transitions. [2020-10-16 11:18:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:55,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 11:18:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:55,342 INFO L225 Difference]: With dead ends: 754 [2020-10-16 11:18:55,343 INFO L226 Difference]: Without dead ends: 659 [2020-10-16 11:18:55,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-16 11:18:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 649. [2020-10-16 11:18:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2020-10-16 11:18:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1991 transitions. [2020-10-16 11:18:55,367 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1991 transitions. Word has length 12 [2020-10-16 11:18:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:55,368 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 1991 transitions. [2020-10-16 11:18:55,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1991 transitions. [2020-10-16 11:18:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:18:55,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:55,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:55,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:18:55,370 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1394966630, now seen corresponding path program 1 times [2020-10-16 11:18:55,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:55,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802401693] [2020-10-16 11:18:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:55,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802401693] [2020-10-16 11:18:55,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:55,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:55,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857192782] [2020-10-16 11:18:55,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:55,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:55,506 INFO L87 Difference]: Start difference. First operand 649 states and 1991 transitions. Second operand 5 states. [2020-10-16 11:18:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:55,610 INFO L93 Difference]: Finished difference Result 703 states and 2105 transitions. [2020-10-16 11:18:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:55,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 11:18:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:55,616 INFO L225 Difference]: With dead ends: 703 [2020-10-16 11:18:55,616 INFO L226 Difference]: Without dead ends: 643 [2020-10-16 11:18:55,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-10-16 11:18:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2020-10-16 11:18:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-10-16 11:18:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1969 transitions. [2020-10-16 11:18:55,637 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1969 transitions. Word has length 13 [2020-10-16 11:18:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:55,638 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 1969 transitions. [2020-10-16 11:18:55,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1969 transitions. [2020-10-16 11:18:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:18:55,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:55,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:55,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:18:55,640 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1203017040, now seen corresponding path program 1 times [2020-10-16 11:18:55,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:55,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302244782] [2020-10-16 11:18:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:55,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302244782] [2020-10-16 11:18:55,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:55,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:55,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408425333] [2020-10-16 11:18:55,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:55,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:55,710 INFO L87 Difference]: Start difference. First operand 643 states and 1969 transitions. Second operand 6 states. [2020-10-16 11:18:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:55,864 INFO L93 Difference]: Finished difference Result 959 states and 2930 transitions. [2020-10-16 11:18:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:55,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 11:18:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:55,869 INFO L225 Difference]: With dead ends: 959 [2020-10-16 11:18:55,869 INFO L226 Difference]: Without dead ends: 583 [2020-10-16 11:18:55,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:18:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-10-16 11:18:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2020-10-16 11:18:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2020-10-16 11:18:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1770 transitions. [2020-10-16 11:18:55,888 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1770 transitions. Word has length 13 [2020-10-16 11:18:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:55,889 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 1770 transitions. [2020-10-16 11:18:55,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1770 transitions. [2020-10-16 11:18:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:18:55,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:55,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:55,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:18:55,891 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash -559300800, now seen corresponding path program 2 times [2020-10-16 11:18:55,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:55,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956557368] [2020-10-16 11:18:55,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:55,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956557368] [2020-10-16 11:18:55,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:55,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:55,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553291476] [2020-10-16 11:18:55,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:55,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:55,967 INFO L87 Difference]: Start difference. First operand 583 states and 1770 transitions. Second operand 6 states. [2020-10-16 11:18:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:56,122 INFO L93 Difference]: Finished difference Result 747 states and 2233 transitions. [2020-10-16 11:18:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:56,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 11:18:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:56,127 INFO L225 Difference]: With dead ends: 747 [2020-10-16 11:18:56,127 INFO L226 Difference]: Without dead ends: 431 [2020-10-16 11:18:56,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:18:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-16 11:18:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-10-16 11:18:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-10-16 11:18:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2020-10-16 11:18:56,140 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13 [2020-10-16 11:18:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:56,140 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2020-10-16 11:18:56,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2020-10-16 11:18:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:18:56,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:56,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:56,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:18:56,142 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash 244893855, now seen corresponding path program 1 times [2020-10-16 11:18:56,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:56,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286060068] [2020-10-16 11:18:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:56,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286060068] [2020-10-16 11:18:56,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:56,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:56,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750474239] [2020-10-16 11:18:56,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:56,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:56,229 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 6 states. [2020-10-16 11:18:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:56,375 INFO L93 Difference]: Finished difference Result 458 states and 1293 transitions. [2020-10-16 11:18:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:56,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 11:18:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:56,381 INFO L225 Difference]: With dead ends: 458 [2020-10-16 11:18:56,381 INFO L226 Difference]: Without dead ends: 413 [2020-10-16 11:18:56,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-10-16 11:18:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2020-10-16 11:18:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-16 11:18:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1188 transitions. [2020-10-16 11:18:56,395 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1188 transitions. Word has length 14 [2020-10-16 11:18:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:56,395 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 1188 transitions. [2020-10-16 11:18:56,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1188 transitions. [2020-10-16 11:18:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:18:56,397 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:56,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:56,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:18:56,397 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 294288294, now seen corresponding path program 1 times [2020-10-16 11:18:56,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:56,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340468789] [2020-10-16 11:18:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:56,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340468789] [2020-10-16 11:18:56,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:56,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:56,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577786627] [2020-10-16 11:18:56,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:56,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:56,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:56,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:56,620 INFO L87 Difference]: Start difference. First operand 413 states and 1188 transitions. Second operand 6 states. [2020-10-16 11:18:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:56,782 INFO L93 Difference]: Finished difference Result 493 states and 1388 transitions. [2020-10-16 11:18:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:56,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 11:18:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:56,785 INFO L225 Difference]: With dead ends: 493 [2020-10-16 11:18:56,786 INFO L226 Difference]: Without dead ends: 441 [2020-10-16 11:18:56,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-16 11:18:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-10-16 11:18:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-16 11:18:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1268 transitions. [2020-10-16 11:18:56,800 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1268 transitions. Word has length 14 [2020-10-16 11:18:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:56,801 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 1268 transitions. [2020-10-16 11:18:56,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1268 transitions. [2020-10-16 11:18:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:18:56,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:56,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:56,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:18:56,803 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -998229363, now seen corresponding path program 1 times [2020-10-16 11:18:56,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:56,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720357965] [2020-10-16 11:18:56,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:57,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720357965] [2020-10-16 11:18:57,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:57,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:18:57,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063014011] [2020-10-16 11:18:57,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:18:57,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:57,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:18:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:18:57,012 INFO L87 Difference]: Start difference. First operand 441 states and 1268 transitions. Second operand 7 states. [2020-10-16 11:18:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:57,200 INFO L93 Difference]: Finished difference Result 543 states and 1540 transitions. [2020-10-16 11:18:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:57,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 11:18:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:57,205 INFO L225 Difference]: With dead ends: 543 [2020-10-16 11:18:57,205 INFO L226 Difference]: Without dead ends: 491 [2020-10-16 11:18:57,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:18:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-10-16 11:18:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 485. [2020-10-16 11:18:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-16 11:18:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1392 transitions. [2020-10-16 11:18:57,219 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1392 transitions. Word has length 15 [2020-10-16 11:18:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:57,219 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1392 transitions. [2020-10-16 11:18:57,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:18:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1392 transitions. [2020-10-16 11:18:57,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:18:57,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:57,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:57,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:18:57,221 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash 532955001, now seen corresponding path program 1 times [2020-10-16 11:18:57,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:57,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055699216] [2020-10-16 11:18:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:57,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055699216] [2020-10-16 11:18:57,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:57,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:18:57,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904190229] [2020-10-16 11:18:57,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:18:57,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:18:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:18:57,456 INFO L87 Difference]: Start difference. First operand 485 states and 1392 transitions. Second operand 7 states. [2020-10-16 11:18:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:57,634 INFO L93 Difference]: Finished difference Result 509 states and 1432 transitions. [2020-10-16 11:18:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:57,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 11:18:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:57,638 INFO L225 Difference]: With dead ends: 509 [2020-10-16 11:18:57,638 INFO L226 Difference]: Without dead ends: 477 [2020-10-16 11:18:57,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:18:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-10-16 11:18:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2020-10-16 11:18:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-10-16 11:18:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1364 transitions. [2020-10-16 11:18:57,651 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1364 transitions. Word has length 15 [2020-10-16 11:18:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:57,651 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 1364 transitions. [2020-10-16 11:18:57,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:18:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1364 transitions. [2020-10-16 11:18:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:18:57,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:57,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:57,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:18:57,653 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash -880386702, now seen corresponding path program 1 times [2020-10-16 11:18:57,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:57,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493645254] [2020-10-16 11:18:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:57,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493645254] [2020-10-16 11:18:57,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:57,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:18:57,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374421761] [2020-10-16 11:18:57,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:18:57,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:18:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:57,881 INFO L87 Difference]: Start difference. First operand 477 states and 1364 transitions. Second operand 8 states. [2020-10-16 11:18:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:58,064 INFO L93 Difference]: Finished difference Result 563 states and 1600 transitions. [2020-10-16 11:18:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:58,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 11:18:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:58,072 INFO L225 Difference]: With dead ends: 563 [2020-10-16 11:18:58,072 INFO L226 Difference]: Without dead ends: 531 [2020-10-16 11:18:58,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:18:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-10-16 11:18:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 483. [2020-10-16 11:18:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2020-10-16 11:18:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1386 transitions. [2020-10-16 11:18:58,086 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1386 transitions. Word has length 16 [2020-10-16 11:18:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:58,087 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 1386 transitions. [2020-10-16 11:18:58,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:18:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1386 transitions. [2020-10-16 11:18:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:18:58,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:58,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:58,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:18:58,089 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash -880379975, now seen corresponding path program 1 times [2020-10-16 11:18:58,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:58,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114124392] [2020-10-16 11:18:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:58,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114124392] [2020-10-16 11:18:58,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:58,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:18:58,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316332485] [2020-10-16 11:18:58,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:18:58,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:18:58,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:58,321 INFO L87 Difference]: Start difference. First operand 483 states and 1386 transitions. Second operand 8 states. [2020-10-16 11:18:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:58,636 INFO L93 Difference]: Finished difference Result 585 states and 1649 transitions. [2020-10-16 11:18:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:58,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 11:18:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:58,640 INFO L225 Difference]: With dead ends: 585 [2020-10-16 11:18:58,640 INFO L226 Difference]: Without dead ends: 553 [2020-10-16 11:18:58,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:18:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-16 11:18:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 487. [2020-10-16 11:18:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-10-16 11:18:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1396 transitions. [2020-10-16 11:18:58,654 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1396 transitions. Word has length 16 [2020-10-16 11:18:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:58,654 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 1396 transitions. [2020-10-16 11:18:58,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:18:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1396 transitions. [2020-10-16 11:18:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:18:58,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:58,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:58,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:18:58,656 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash -658305908, now seen corresponding path program 2 times [2020-10-16 11:18:58,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:58,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678153731] [2020-10-16 11:18:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:58,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-16 11:18:58,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678153731] [2020-10-16 11:18:58,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:58,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:18:58,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919612790] [2020-10-16 11:18:58,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:18:58,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:18:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:58,910 INFO L87 Difference]: Start difference. First operand 487 states and 1396 transitions. Second operand 8 states. [2020-10-16 11:18:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:59,107 INFO L93 Difference]: Finished difference Result 741 states and 2083 transitions. [2020-10-16 11:18:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:18:59,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 11:18:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:59,113 INFO L225 Difference]: With dead ends: 741 [2020-10-16 11:18:59,113 INFO L226 Difference]: Without dead ends: 707 [2020-10-16 11:18:59,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:18:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2020-10-16 11:18:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 505. [2020-10-16 11:18:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2020-10-16 11:18:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1447 transitions. [2020-10-16 11:18:59,129 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1447 transitions. Word has length 16 [2020-10-16 11:18:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:59,130 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 1447 transitions. [2020-10-16 11:18:59,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:18:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1447 transitions. [2020-10-16 11:18:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:18:59,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:59,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:59,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:18:59,132 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash -658132928, now seen corresponding path program 3 times [2020-10-16 11:18:59,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:59,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651305162] [2020-10-16 11:18:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:59,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651305162] [2020-10-16 11:18:59,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:59,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:18:59,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063195007] [2020-10-16 11:18:59,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:18:59,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:59,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:18:59,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:59,364 INFO L87 Difference]: Start difference. First operand 505 states and 1447 transitions. Second operand 8 states. [2020-10-16 11:18:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:59,657 INFO L93 Difference]: Finished difference Result 549 states and 1545 transitions. [2020-10-16 11:18:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:18:59,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 11:18:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:59,664 INFO L225 Difference]: With dead ends: 549 [2020-10-16 11:18:59,664 INFO L226 Difference]: Without dead ends: 521 [2020-10-16 11:18:59,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:18:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-16 11:18:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 479. [2020-10-16 11:18:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-10-16 11:18:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1359 transitions. [2020-10-16 11:18:59,677 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1359 transitions. Word has length 16 [2020-10-16 11:18:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:59,678 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 1359 transitions. [2020-10-16 11:18:59,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:18:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1359 transitions. [2020-10-16 11:18:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:18:59,679 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:59,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:59,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 11:18:59,680 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -658556729, now seen corresponding path program 1 times [2020-10-16 11:18:59,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:59,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032394988] [2020-10-16 11:18:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:59,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032394988] [2020-10-16 11:18:59,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:59,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:59,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832971907] [2020-10-16 11:18:59,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:59,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:59,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:59,736 INFO L87 Difference]: Start difference. First operand 479 states and 1359 transitions. Second operand 4 states. [2020-10-16 11:18:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:59,761 INFO L93 Difference]: Finished difference Result 717 states and 2001 transitions. [2020-10-16 11:18:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:18:59,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 11:18:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:59,764 INFO L225 Difference]: With dead ends: 717 [2020-10-16 11:18:59,765 INFO L226 Difference]: Without dead ends: 383 [2020-10-16 11:18:59,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2020-10-16 11:18:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 359. [2020-10-16 11:18:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-10-16 11:18:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 935 transitions. [2020-10-16 11:18:59,775 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 935 transitions. Word has length 16 [2020-10-16 11:18:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:59,775 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 935 transitions. [2020-10-16 11:18:59,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 935 transitions. [2020-10-16 11:18:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:18:59,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:59,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:59,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 11:18:59,777 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1070278051, now seen corresponding path program 2 times [2020-10-16 11:18:59,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:59,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228913302] [2020-10-16 11:18:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:59,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228913302] [2020-10-16 11:18:59,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:59,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:59,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901251261] [2020-10-16 11:18:59,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:59,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:59,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:59,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:59,829 INFO L87 Difference]: Start difference. First operand 359 states and 935 transitions. Second operand 4 states. [2020-10-16 11:18:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:59,857 INFO L93 Difference]: Finished difference Result 348 states and 807 transitions. [2020-10-16 11:18:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:59,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 11:18:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:59,860 INFO L225 Difference]: With dead ends: 348 [2020-10-16 11:18:59,860 INFO L226 Difference]: Without dead ends: 269 [2020-10-16 11:18:59,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-10-16 11:18:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2020-10-16 11:18:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-16 11:18:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 617 transitions. [2020-10-16 11:18:59,866 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 617 transitions. Word has length 16 [2020-10-16 11:18:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:59,866 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 617 transitions. [2020-10-16 11:18:59,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 617 transitions. [2020-10-16 11:18:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:18:59,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:59,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:59,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 11:18:59,868 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash -55478072, now seen corresponding path program 1 times [2020-10-16 11:18:59,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:59,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045116354] [2020-10-16 11:18:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:18:59,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045116354] [2020-10-16 11:18:59,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:59,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:59,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27123281] [2020-10-16 11:18:59,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:59,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:59,945 INFO L87 Difference]: Start difference. First operand 269 states and 617 transitions. Second operand 5 states. [2020-10-16 11:18:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:59,997 INFO L93 Difference]: Finished difference Result 219 states and 451 transitions. [2020-10-16 11:18:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:59,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 11:18:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:00,000 INFO L225 Difference]: With dead ends: 219 [2020-10-16 11:19:00,000 INFO L226 Difference]: Without dead ends: 177 [2020-10-16 11:19:00,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:19:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-16 11:19:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-10-16 11:19:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-16 11:19:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 357 transitions. [2020-10-16 11:19:00,007 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 357 transitions. Word has length 17 [2020-10-16 11:19:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:00,007 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 357 transitions. [2020-10-16 11:19:00,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:19:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 357 transitions. [2020-10-16 11:19:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:19:00,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:00,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:00,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 11:19:00,008 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash -952257862, now seen corresponding path program 1 times [2020-10-16 11:19:00,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:00,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711235026] [2020-10-16 11:19:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:00,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711235026] [2020-10-16 11:19:00,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:00,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:19:00,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177123227] [2020-10-16 11:19:00,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:19:00,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:19:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:19:00,370 INFO L87 Difference]: Start difference. First operand 177 states and 357 transitions. Second operand 9 states. [2020-10-16 11:19:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:00,612 INFO L93 Difference]: Finished difference Result 192 states and 375 transitions. [2020-10-16 11:19:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:19:00,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-16 11:19:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:00,614 INFO L225 Difference]: With dead ends: 192 [2020-10-16 11:19:00,614 INFO L226 Difference]: Without dead ends: 176 [2020-10-16 11:19:00,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:19:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-16 11:19:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-16 11:19:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-16 11:19:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 355 transitions. [2020-10-16 11:19:00,624 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 355 transitions. Word has length 19 [2020-10-16 11:19:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:00,625 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 355 transitions. [2020-10-16 11:19:00,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:19:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 355 transitions. [2020-10-16 11:19:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:19:00,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:00,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:00,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 11:19:00,627 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:00,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash -323303904, now seen corresponding path program 2 times [2020-10-16 11:19:00,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:00,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114181675] [2020-10-16 11:19:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:00,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114181675] [2020-10-16 11:19:00,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:00,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:19:00,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771613108] [2020-10-16 11:19:00,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:19:00,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:00,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:19:00,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:19:00,898 INFO L87 Difference]: Start difference. First operand 176 states and 355 transitions. Second operand 8 states. [2020-10-16 11:19:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:01,072 INFO L93 Difference]: Finished difference Result 236 states and 453 transitions. [2020-10-16 11:19:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:19:01,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-16 11:19:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:01,074 INFO L225 Difference]: With dead ends: 236 [2020-10-16 11:19:01,074 INFO L226 Difference]: Without dead ends: 188 [2020-10-16 11:19:01,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:19:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-10-16 11:19:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2020-10-16 11:19:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-16 11:19:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 362 transitions. [2020-10-16 11:19:01,079 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 362 transitions. Word has length 19 [2020-10-16 11:19:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:01,079 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 362 transitions. [2020-10-16 11:19:01,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:19:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 362 transitions. [2020-10-16 11:19:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:19:01,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:01,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:01,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 11:19:01,080 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1744897356, now seen corresponding path program 3 times [2020-10-16 11:19:01,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:01,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148154308] [2020-10-16 11:19:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:01,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148154308] [2020-10-16 11:19:01,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:01,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:19:01,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506743915] [2020-10-16 11:19:01,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:19:01,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:19:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:19:01,416 INFO L87 Difference]: Start difference. First operand 182 states and 362 transitions. Second operand 9 states. [2020-10-16 11:19:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:01,617 INFO L93 Difference]: Finished difference Result 208 states and 399 transitions. [2020-10-16 11:19:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:19:01,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-16 11:19:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:01,619 INFO L225 Difference]: With dead ends: 208 [2020-10-16 11:19:01,619 INFO L226 Difference]: Without dead ends: 145 [2020-10-16 11:19:01,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:19:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-16 11:19:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2020-10-16 11:19:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-16 11:19:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions. [2020-10-16 11:19:01,622 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19 [2020-10-16 11:19:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:01,622 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 262 transitions. [2020-10-16 11:19:01,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:19:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2020-10-16 11:19:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:19:01,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:01,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:01,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 11:19:01,623 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1136707252, now seen corresponding path program 1 times [2020-10-16 11:19:01,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:01,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858112078] [2020-10-16 11:19:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:01,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858112078] [2020-10-16 11:19:01,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:01,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:19:01,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181364262] [2020-10-16 11:19:01,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:19:01,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:01,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:19:01,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:19:01,687 INFO L87 Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states. [2020-10-16 11:19:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:01,729 INFO L93 Difference]: Finished difference Result 112 states and 223 transitions. [2020-10-16 11:19:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:19:01,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 11:19:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:01,730 INFO L225 Difference]: With dead ends: 112 [2020-10-16 11:19:01,730 INFO L226 Difference]: Without dead ends: 63 [2020-10-16 11:19:01,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:19:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-16 11:19:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-16 11:19:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-16 11:19:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-16 11:19:01,732 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-16 11:19:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:01,733 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-16 11:19:01,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:19:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-16 11:19:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:19:01,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:01,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:01,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 11:19:01,734 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash -898304440, now seen corresponding path program 1 times [2020-10-16 11:19:01,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:01,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382249610] [2020-10-16 11:19:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:19:01,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:19:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:19:01,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:19:01,839 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:19:01,839 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:19:01,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 11:19:01,857 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,860 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,860 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:01,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:01,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:19:01 BasicIcfg [2020-10-16 11:19:01,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:19:01,951 INFO L168 Benchmark]: Toolchain (without parser) took 18114.26 ms. Allocated memory was 141.0 MB in the beginning and 437.8 MB in the end (delta: 296.7 MB). Free memory was 102.6 MB in the beginning and 154.5 MB in the end (delta: -51.9 MB). Peak memory consumption was 244.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:01,952 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-10-16 11:19:01,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.99 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 102.2 MB in the beginning and 157.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:01,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.64 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 153.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:01,953 INFO L168 Benchmark]: Boogie Preprocessor took 70.35 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:01,954 INFO L168 Benchmark]: RCFGBuilder took 2194.57 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 151.3 MB in the beginning and 157.5 MB in the end (delta: -6.2 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:01,959 INFO L168 Benchmark]: TraceAbstraction took 14989.16 ms. Allocated memory was 245.9 MB in the beginning and 437.8 MB in the end (delta: 191.9 MB). Free memory was 155.8 MB in the beginning and 154.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 193.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:01,962 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.53 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.99 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 102.2 MB in the beginning and 157.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.64 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 153.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.35 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2194.57 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 151.3 MB in the beginning and 157.5 MB in the end (delta: -6.2 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14989.16 ms. Allocated memory was 245.9 MB in the beginning and 437.8 MB in the end (delta: 191.9 MB). Free memory was 155.8 MB in the beginning and 154.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 193.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1045 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.3s, 100 PlacesBefore, 37 PlacesAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4811 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L708] 0 int z = 0; [L709] 0 _Bool z$flush_delayed; [L710] 0 int z$mem_tmp; [L711] 0 _Bool z$r_buff0_thd0; [L712] 0 _Bool z$r_buff0_thd1; [L713] 0 _Bool z$r_buff0_thd2; [L714] 0 _Bool z$r_buff0_thd3; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$r_buff1_thd3; [L719] 0 _Bool z$read_delayed; [L720] 0 int *z$read_delayed_var; [L721] 0 int z$w_buff0; [L722] 0 _Bool z$w_buff0_used; [L723] 0 int z$w_buff1; [L724] 0 _Bool z$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2031; [L808] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 0 pthread_t t2032; [L810] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t2033; [L812] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 2 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L765] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L768] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L782] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 z$flush_delayed = weak$$choice2 [L828] 0 z$mem_tmp = z [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L837] 0 z = z$flush_delayed ? z$mem_tmp : z [L838] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.7s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 629 SDtfs, 864 SDslu, 1647 SDs, 0 SdLazy, 1000 SolverSat, 257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 434 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 60386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...