/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:32:43,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:32:43,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:32:43,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:32:43,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:32:43,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:32:43,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:32:43,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:32:43,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:32:43,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:32:43,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:32:43,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:32:43,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:32:43,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:32:43,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:32:43,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:32:43,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:32:43,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:32:43,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:32:43,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:32:43,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:32:43,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:32:43,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:32:43,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:32:43,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:32:43,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:32:43,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:32:43,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:32:43,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:32:43,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:32:43,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:32:43,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:32:43,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:32:43,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:32:43,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:32:43,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:32:43,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:32:43,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:32:43,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:32:43,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:32:43,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:32:43,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:32:43,507 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:32:43,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:32:43,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:32:43,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:32:43,509 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:32:43,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:32:43,510 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:32:43,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:32:43,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:32:43,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:32:43,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:32:43,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:32:43,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:32:43,511 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:32:43,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:32:43,511 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:32:43,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:32:43,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:32:43,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:32:43,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:32:43,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:32:43,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:32:43,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:32:43,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:32:43,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:32:43,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:32:43,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:32:43,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:32:43,514 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:32:43,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:32:43,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:32:43,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:32:43,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:32:43,840 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:32:43,840 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:32:43,841 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-10-15 18:32:43,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d55ece9/b6a39b55a29a423abd2267ba2b62e1f5/FLAGeb1c5014a [2020-10-15 18:32:44,504 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:32:44,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-10-15 18:32:44,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d55ece9/b6a39b55a29a423abd2267ba2b62e1f5/FLAGeb1c5014a [2020-10-15 18:32:44,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d55ece9/b6a39b55a29a423abd2267ba2b62e1f5 [2020-10-15 18:32:44,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:32:44,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:32:44,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:32:44,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:32:44,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:32:44,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:32:44" (1/1) ... [2020-10-15 18:32:44,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b04d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:44, skipping insertion in model container [2020-10-15 18:32:44,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:32:44" (1/1) ... [2020-10-15 18:32:44,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:32:44,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:32:45,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:32:45,401 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:32:45,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:32:45,587 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:32:45,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45 WrapperNode [2020-10-15 18:32:45,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:32:45,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:32:45,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:32:45,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:32:45,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:32:45,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:32:45,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:32:45,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:32:45,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... [2020-10-15 18:32:45,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:32:45,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:32:45,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:32:45,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:32:45,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:32:45,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:32:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:32:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:32:45,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:32:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:32:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:32:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:32:45,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:32:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:32:45,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:32:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:32:45,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:32:45,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:32:45,783 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:32:47,929 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:32:47,929 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:32:47,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:32:47 BoogieIcfgContainer [2020-10-15 18:32:47,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:32:47,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:32:47,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:32:47,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:32:47,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:32:44" (1/3) ... [2020-10-15 18:32:47,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780d1df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:32:47, skipping insertion in model container [2020-10-15 18:32:47,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:32:45" (2/3) ... [2020-10-15 18:32:47,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780d1df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:32:47, skipping insertion in model container [2020-10-15 18:32:47,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:32:47" (3/3) ... [2020-10-15 18:32:47,941 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2020-10-15 18:32:47,952 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:32:47,953 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:32:47,960 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:32:47,961 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:32:47,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,992 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,992 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,993 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,993 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,996 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:47,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,007 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,008 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,015 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,015 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,015 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:32:48,034 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 18:32:48,056 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:32:48,056 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:32:48,056 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:32:48,056 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:32:48,056 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:32:48,057 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:32:48,057 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:32:48,057 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:32:48,071 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:32:48,073 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-15 18:32:48,076 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-15 18:32:48,078 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-15 18:32:48,127 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-15 18:32:48,128 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:32:48,133 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-15 18:32:48,136 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-15 18:32:48,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:32:48,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:32:48,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:48,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:32:48,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:48,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:32:48,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:48,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:32:48,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:48,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:48,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:48,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:48,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:48,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:48,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:49,126 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-15 18:32:49,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:32:49,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:49,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:32:49,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:49,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:49,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:49,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:49,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:49,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:49,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:49,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:49,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:49,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:49,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:49,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:49,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:49,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:49,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:32:49,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:32:49,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:32:49,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:32:49,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:32:49,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,526 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-15 18:32:49,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,528 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-15 18:32:49,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:32:49,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:49,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:49,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 18:32:49,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:32:49,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:32:49,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:50,839 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-15 18:32:50,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-15 18:32:50,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:50,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:32:50,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:51,832 WARN L193 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-15 18:32:51,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:32:51,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:52,223 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-15 18:32:52,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:32:52,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:52,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:52,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:52,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:52,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:52,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:52,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:52,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:52,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:52,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:52,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:52,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:52,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:52,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:52,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:52,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:52,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:53,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:53,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:32:53,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:32:53,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:32:53,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:53,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:32:53,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:32:53,915 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-10-15 18:32:54,134 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-15 18:32:54,239 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-15 18:32:54,247 INFO L132 LiptonReduction]: Checked pairs total: 4811 [2020-10-15 18:32:54,247 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-15 18:32:54,255 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-15 18:32:54,330 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-15 18:32:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-15 18:32:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 18:32:54,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:54,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 18:32:54,340 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-15 18:32:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1041180, now seen corresponding path program 1 times [2020-10-15 18:32:54,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:54,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947236732] [2020-10-15 18:32:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:54,558 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-15 18:32:54,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947236732] [2020-10-15 18:32:54,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:54,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:32:54,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669515571] [2020-10-15 18:32:54,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:32:54,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:54,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:32:54,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:32:54,584 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-15 18:32:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:54,696 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-15 18:32:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:32:54,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 18:32:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:54,726 INFO L225 Difference]: With dead ends: 812 [2020-10-15 18:32:54,726 INFO L226 Difference]: Without dead ends: 687 [2020-10-15 18:32:54,728 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-15 18:32:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-15 18:32:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-15 18:32:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-15 18:32:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-15 18:32:54,839 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-15 18:32:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:54,840 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-15 18:32:54,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:32:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-15 18:32:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:32:54,842 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:54,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:54,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:32:54,843 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-15 18:32:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash 626468161, now seen corresponding path program 1 times [2020-10-15 18:32:54,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:54,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158828834] [2020-10-15 18:32:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:55,069 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-15 18:32:55,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158828834] [2020-10-15 18:32:55,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:55,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:32:55,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123426370] [2020-10-15 18:32:55,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:32:55,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:55,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:32:55,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:32:55,073 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-15 18:32:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:55,165 INFO L93 Difference]: Finished difference Result 802 states and 2417 transitions. [2020-10-15 18:32:55,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:32:55,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-15 18:32:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:55,173 INFO L225 Difference]: With dead ends: 802 [2020-10-15 18:32:55,174 INFO L226 Difference]: Without dead ends: 677 [2020-10-15 18:32:55,175 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-15 18:32:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-10-15 18:32:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2020-10-15 18:32:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-15 18:32:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions. [2020-10-15 18:32:55,210 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10 [2020-10-15 18:32:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:55,212 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions. [2020-10-15 18:32:55,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:32:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions. [2020-10-15 18:32:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:32:55,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:55,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:55,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:32:55,215 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-15 18:32:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash 254166472, now seen corresponding path program 1 times [2020-10-15 18:32:55,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:55,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809528963] [2020-10-15 18:32:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:55,389 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-15 18:32:55,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809528963] [2020-10-15 18:32:55,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:55,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:32:55,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514319976] [2020-10-15 18:32:55,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:32:55,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:32:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:32:55,392 INFO L87 Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 4 states. [2020-10-15 18:32:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:55,486 INFO L93 Difference]: Finished difference Result 769 states and 2321 transitions. [2020-10-15 18:32:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:32:55,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 18:32:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:55,492 INFO L225 Difference]: With dead ends: 769 [2020-10-15 18:32:55,493 INFO L226 Difference]: Without dead ends: 669 [2020-10-15 18:32:55,493 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-15 18:32:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-10-15 18:32:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2020-10-15 18:32:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-10-15 18:32:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 2082 transitions. [2020-10-15 18:32:55,521 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 2082 transitions. Word has length 11 [2020-10-15 18:32:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:55,521 INFO L481 AbstractCegarLoop]: Abstraction has 669 states and 2082 transitions. [2020-10-15 18:32:55,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:32:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 2082 transitions. [2020-10-15 18:32:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:32:55,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:55,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:55,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:32:55,525 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-15 18:32:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2054327765, now seen corresponding path program 1 times [2020-10-15 18:32:55,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:55,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215654148] [2020-10-15 18:32:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:55,606 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-15 18:32:55,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215654148] [2020-10-15 18:32:55,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:55,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:32:55,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959002966] [2020-10-15 18:32:55,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:32:55,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:55,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:32:55,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:32:55,609 INFO L87 Difference]: Start difference. First operand 669 states and 2082 transitions. Second operand 4 states. [2020-10-15 18:32:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:55,645 INFO L93 Difference]: Finished difference Result 729 states and 2195 transitions. [2020-10-15 18:32:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:32:55,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 18:32:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:55,651 INFO L225 Difference]: With dead ends: 729 [2020-10-15 18:32:55,651 INFO L226 Difference]: Without dead ends: 629 [2020-10-15 18:32:55,652 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-15 18:32:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-10-15 18:32:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2020-10-15 18:32:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-10-15 18:32:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1940 transitions. [2020-10-15 18:32:55,677 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1940 transitions. Word has length 11 [2020-10-15 18:32:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:55,677 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1940 transitions. [2020-10-15 18:32:55,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:32:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1940 transitions. [2020-10-15 18:32:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:32:55,685 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:55,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:55,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:32:55,686 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-15 18:32:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash -731543524, now seen corresponding path program 1 times [2020-10-15 18:32:55,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:55,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946595596] [2020-10-15 18:32:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:55,862 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-15 18:32:55,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946595596] [2020-10-15 18:32:55,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:55,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:32:55,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049048454] [2020-10-15 18:32:55,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:32:55,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:32:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:32:55,864 INFO L87 Difference]: Start difference. First operand 629 states and 1940 transitions. Second operand 5 states. [2020-10-15 18:32:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:56,036 INFO L93 Difference]: Finished difference Result 737 states and 2221 transitions. [2020-10-15 18:32:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:32:56,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:32:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:56,042 INFO L225 Difference]: With dead ends: 737 [2020-10-15 18:32:56,043 INFO L226 Difference]: Without dead ends: 657 [2020-10-15 18:32:56,043 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-15 18:32:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-10-15 18:32:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2020-10-15 18:32:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2020-10-15 18:32:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2021 transitions. [2020-10-15 18:32:56,063 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 2021 transitions. Word has length 12 [2020-10-15 18:32:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:56,064 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 2021 transitions. [2020-10-15 18:32:56,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:32:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 2021 transitions. [2020-10-15 18:32:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:32:56,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:56,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:56,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:32:56,066 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-15 18:32:56,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash 96620521, now seen corresponding path program 1 times [2020-10-15 18:32:56,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:56,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686155089] [2020-10-15 18:32:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:56,128 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-15 18:32:56,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686155089] [2020-10-15 18:32:56,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:56,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:32:56,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396568055] [2020-10-15 18:32:56,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:32:56,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:32:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:32:56,131 INFO L87 Difference]: Start difference. First operand 657 states and 2021 transitions. Second operand 5 states. [2020-10-15 18:32:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:56,180 INFO L93 Difference]: Finished difference Result 817 states and 2469 transitions. [2020-10-15 18:32:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:32:56,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:32:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:56,183 INFO L225 Difference]: With dead ends: 817 [2020-10-15 18:32:56,184 INFO L226 Difference]: Without dead ends: 437 [2020-10-15 18:32:56,185 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-15 18:32:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-15 18:32:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-10-15 18:32:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-10-15 18:32:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions. [2020-10-15 18:32:56,197 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12 [2020-10-15 18:32:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:56,198 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions. [2020-10-15 18:32:56,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:32:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions. [2020-10-15 18:32:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:32:56,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:56,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:56,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:32:56,200 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-15 18:32:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1394966630, now seen corresponding path program 1 times [2020-10-15 18:32:56,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:56,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917636034] [2020-10-15 18:32:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:56,368 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-15 18:32:56,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917636034] [2020-10-15 18:32:56,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:56,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:32:56,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136697184] [2020-10-15 18:32:56,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:32:56,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:56,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:32:56,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:32:56,371 INFO L87 Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 5 states. [2020-10-15 18:32:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:56,461 INFO L93 Difference]: Finished difference Result 495 states and 1396 transitions. [2020-10-15 18:32:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:32:56,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 18:32:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:56,466 INFO L225 Difference]: With dead ends: 495 [2020-10-15 18:32:56,466 INFO L226 Difference]: Without dead ends: 435 [2020-10-15 18:32:56,466 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-15 18:32:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-10-15 18:32:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2020-10-15 18:32:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-10-15 18:32:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1262 transitions. [2020-10-15 18:32:56,481 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1262 transitions. Word has length 13 [2020-10-15 18:32:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:56,481 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 1262 transitions. [2020-10-15 18:32:56,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:32:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1262 transitions. [2020-10-15 18:32:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:32:56,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:56,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:56,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:32:56,483 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-15 18:32:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash 340115003, now seen corresponding path program 1 times [2020-10-15 18:32:56,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:56,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082203064] [2020-10-15 18:32:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:56,548 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-15 18:32:56,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082203064] [2020-10-15 18:32:56,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:56,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:32:56,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086744598] [2020-10-15 18:32:56,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:32:56,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:56,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:32:56,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:32:56,550 INFO L87 Difference]: Start difference. First operand 435 states and 1262 transitions. Second operand 4 states. [2020-10-15 18:32:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:56,623 INFO L93 Difference]: Finished difference Result 471 states and 1332 transitions. [2020-10-15 18:32:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:32:56,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 18:32:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:56,628 INFO L225 Difference]: With dead ends: 471 [2020-10-15 18:32:56,629 INFO L226 Difference]: Without dead ends: 431 [2020-10-15 18:32:56,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 18:32:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-15 18:32:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-10-15 18:32:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-10-15 18:32:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2020-10-15 18:32:56,645 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 14 [2020-10-15 18:32:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:56,645 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2020-10-15 18:32:56,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:32:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2020-10-15 18:32:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:32:56,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:56,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:56,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:32:56,647 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-15 18:32:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash 244893855, now seen corresponding path program 1 times [2020-10-15 18:32:56,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:56,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979351614] [2020-10-15 18:32:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:56,806 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-15 18:32:56,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979351614] [2020-10-15 18:32:56,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:56,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:32:56,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044622251] [2020-10-15 18:32:56,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:32:56,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:32:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:32:56,809 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 6 states. [2020-10-15 18:32:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:56,986 INFO L93 Difference]: Finished difference Result 482 states and 1363 transitions. [2020-10-15 18:32:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:32:56,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-15 18:32:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:56,990 INFO L225 Difference]: With dead ends: 482 [2020-10-15 18:32:56,990 INFO L226 Difference]: Without dead ends: 435 [2020-10-15 18:32:56,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:32:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-10-15 18:32:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2020-10-15 18:32:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-10-15 18:32:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1259 transitions. [2020-10-15 18:32:57,003 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1259 transitions. Word has length 14 [2020-10-15 18:32:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:57,004 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 1259 transitions. [2020-10-15 18:32:57,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:32:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1259 transitions. [2020-10-15 18:32:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:32:57,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:57,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:57,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:32:57,005 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-15 18:32:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash 294288294, now seen corresponding path program 1 times [2020-10-15 18:32:57,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:57,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025930346] [2020-10-15 18:32:57,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:32:57,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025930346] [2020-10-15 18:32:57,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:57,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:32:57,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824597237] [2020-10-15 18:32:57,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:32:57,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:32:57,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:32:57,136 INFO L87 Difference]: Start difference. First operand 435 states and 1259 transitions. Second operand 6 states. [2020-10-15 18:32:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:57,291 INFO L93 Difference]: Finished difference Result 515 states and 1459 transitions. [2020-10-15 18:32:57,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:32:57,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-15 18:32:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:57,295 INFO L225 Difference]: With dead ends: 515 [2020-10-15 18:32:57,296 INFO L226 Difference]: Without dead ends: 463 [2020-10-15 18:32:57,296 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-15 18:32:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2020-10-15 18:32:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2020-10-15 18:32:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2020-10-15 18:32:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1339 transitions. [2020-10-15 18:32:57,309 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1339 transitions. Word has length 14 [2020-10-15 18:32:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:57,310 INFO L481 AbstractCegarLoop]: Abstraction has 463 states and 1339 transitions. [2020-10-15 18:32:57,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:32:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1339 transitions. [2020-10-15 18:32:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:32:57,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:57,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:57,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:32:57,312 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-15 18:32:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:57,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1053164928, now seen corresponding path program 1 times [2020-10-15 18:32:57,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:57,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179364787] [2020-10-15 18:32:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:57,522 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-15 18:32:57,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179364787] [2020-10-15 18:32:57,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:57,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:32:57,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086315195] [2020-10-15 18:32:57,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:32:57,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:32:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:32:57,525 INFO L87 Difference]: Start difference. First operand 463 states and 1339 transitions. Second operand 7 states. [2020-10-15 18:32:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:57,684 INFO L93 Difference]: Finished difference Result 487 states and 1377 transitions. [2020-10-15 18:32:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:32:57,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-15 18:32:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:57,688 INFO L225 Difference]: With dead ends: 487 [2020-10-15 18:32:57,688 INFO L226 Difference]: Without dead ends: 447 [2020-10-15 18:32:57,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:32:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-15 18:32:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-10-15 18:32:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-15 18:32:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1268 transitions. [2020-10-15 18:32:57,701 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1268 transitions. Word has length 15 [2020-10-15 18:32:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:57,701 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 1268 transitions. [2020-10-15 18:32:57,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:32:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1268 transitions. [2020-10-15 18:32:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:32:57,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:57,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:57,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:32:57,703 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-15 18:32:57,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash -998229363, now seen corresponding path program 1 times [2020-10-15 18:32:57,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:57,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550931261] [2020-10-15 18:32:57,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:57,889 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-15 18:32:57,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550931261] [2020-10-15 18:32:57,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:57,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:32:57,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318534825] [2020-10-15 18:32:57,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:32:57,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:57,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:32:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:32:57,891 INFO L87 Difference]: Start difference. First operand 441 states and 1268 transitions. Second operand 7 states. [2020-10-15 18:32:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:58,178 INFO L93 Difference]: Finished difference Result 544 states and 1543 transitions. [2020-10-15 18:32:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:32:58,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-15 18:32:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:58,182 INFO L225 Difference]: With dead ends: 544 [2020-10-15 18:32:58,182 INFO L226 Difference]: Without dead ends: 492 [2020-10-15 18:32:58,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:32:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-15 18:32:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 485. [2020-10-15 18:32:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-15 18:32:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1392 transitions. [2020-10-15 18:32:58,196 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1392 transitions. Word has length 15 [2020-10-15 18:32:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:58,197 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1392 transitions. [2020-10-15 18:32:58,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:32:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1392 transitions. [2020-10-15 18:32:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:32:58,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:58,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:58,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:32:58,199 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-15 18:32:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:58,199 INFO L82 PathProgramCache]: Analyzing trace with hash 532955001, now seen corresponding path program 1 times [2020-10-15 18:32:58,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:58,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998538150] [2020-10-15 18:32:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:58,500 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-15 18:32:58,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998538150] [2020-10-15 18:32:58,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:58,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:32:58,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973465465] [2020-10-15 18:32:58,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:32:58,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:32:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:32:58,502 INFO L87 Difference]: Start difference. First operand 485 states and 1392 transitions. Second operand 7 states. [2020-10-15 18:32:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:58,797 INFO L93 Difference]: Finished difference Result 509 states and 1432 transitions. [2020-10-15 18:32:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:32:58,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-15 18:32:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:58,802 INFO L225 Difference]: With dead ends: 509 [2020-10-15 18:32:58,802 INFO L226 Difference]: Without dead ends: 477 [2020-10-15 18:32:58,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:32:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-10-15 18:32:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2020-10-15 18:32:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-10-15 18:32:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1364 transitions. [2020-10-15 18:32:58,817 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1364 transitions. Word has length 15 [2020-10-15 18:32:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:58,817 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 1364 transitions. [2020-10-15 18:32:58,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:32:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1364 transitions. [2020-10-15 18:32:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:32:58,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:58,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:58,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:32:58,820 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-15 18:32:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash -880386702, now seen corresponding path program 1 times [2020-10-15 18:32:58,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:58,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341097415] [2020-10-15 18:32:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:59,149 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-15 18:32:59,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341097415] [2020-10-15 18:32:59,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:59,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:32:59,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550068065] [2020-10-15 18:32:59,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:32:59,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:59,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:32:59,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:32:59,152 INFO L87 Difference]: Start difference. First operand 477 states and 1364 transitions. Second operand 8 states. [2020-10-15 18:32:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:32:59,441 INFO L93 Difference]: Finished difference Result 563 states and 1600 transitions. [2020-10-15 18:32:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:32:59,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-15 18:32:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:32:59,447 INFO L225 Difference]: With dead ends: 563 [2020-10-15 18:32:59,447 INFO L226 Difference]: Without dead ends: 531 [2020-10-15 18:32:59,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:32:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-10-15 18:32:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 483. [2020-10-15 18:32:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2020-10-15 18:32:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1386 transitions. [2020-10-15 18:32:59,464 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1386 transitions. Word has length 16 [2020-10-15 18:32:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:32:59,464 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 1386 transitions. [2020-10-15 18:32:59,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:32:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1386 transitions. [2020-10-15 18:32:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:32:59,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:32:59,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:32:59,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:32:59,466 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-15 18:32:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:32:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash -880379975, now seen corresponding path program 1 times [2020-10-15 18:32:59,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:32:59,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278840145] [2020-10-15 18:32:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:32:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:32:59,744 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-15 18:32:59,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278840145] [2020-10-15 18:32:59,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:32:59,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:32:59,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165007406] [2020-10-15 18:32:59,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:32:59,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:32:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:32:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:32:59,746 INFO L87 Difference]: Start difference. First operand 483 states and 1386 transitions. Second operand 8 states. [2020-10-15 18:33:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:00,001 INFO L93 Difference]: Finished difference Result 605 states and 1715 transitions. [2020-10-15 18:33:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:33:00,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-15 18:33:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:00,005 INFO L225 Difference]: With dead ends: 605 [2020-10-15 18:33:00,005 INFO L226 Difference]: Without dead ends: 573 [2020-10-15 18:33:00,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:33:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-10-15 18:33:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 513. [2020-10-15 18:33:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-15 18:33:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1481 transitions. [2020-10-15 18:33:00,019 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1481 transitions. Word has length 16 [2020-10-15 18:33:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:00,019 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1481 transitions. [2020-10-15 18:33:00,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:33:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1481 transitions. [2020-10-15 18:33:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:33:00,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:00,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:33:00,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:33:00,021 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-15 18:33:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash -658305908, now seen corresponding path program 2 times [2020-10-15 18:33:00,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:00,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074658351] [2020-10-15 18:33:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:00,192 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-15 18:33:00,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074658351] [2020-10-15 18:33:00,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:00,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:33:00,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923825537] [2020-10-15 18:33:00,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:33:00,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:00,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:33:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:33:00,194 INFO L87 Difference]: Start difference. First operand 513 states and 1481 transitions. Second operand 7 states. [2020-10-15 18:33:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:00,456 INFO L93 Difference]: Finished difference Result 608 states and 1739 transitions. [2020-10-15 18:33:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:33:00,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 18:33:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:00,463 INFO L225 Difference]: With dead ends: 608 [2020-10-15 18:33:00,463 INFO L226 Difference]: Without dead ends: 578 [2020-10-15 18:33:00,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:33:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-10-15 18:33:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 511. [2020-10-15 18:33:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2020-10-15 18:33:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1474 transitions. [2020-10-15 18:33:00,483 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1474 transitions. Word has length 16 [2020-10-15 18:33:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:00,483 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 1474 transitions. [2020-10-15 18:33:00,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:33:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1474 transitions. [2020-10-15 18:33:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:33:00,486 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:00,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:33:00,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:33:00,486 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-15 18:33:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash -658132928, now seen corresponding path program 3 times [2020-10-15 18:33:00,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:00,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933927679] [2020-10-15 18:33:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:00,704 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-10-15 18:33:00,877 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-15 18:33:00,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933927679] [2020-10-15 18:33:00,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:00,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:33:00,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449952281] [2020-10-15 18:33:00,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:33:00,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:33:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:33:00,879 INFO L87 Difference]: Start difference. First operand 511 states and 1474 transitions. Second operand 7 states. [2020-10-15 18:33:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:01,231 INFO L93 Difference]: Finished difference Result 567 states and 1606 transitions. [2020-10-15 18:33:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:33:01,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 18:33:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:01,236 INFO L225 Difference]: With dead ends: 567 [2020-10-15 18:33:01,237 INFO L226 Difference]: Without dead ends: 533 [2020-10-15 18:33:01,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:33:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-15 18:33:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 479. [2020-10-15 18:33:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-10-15 18:33:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1370 transitions. [2020-10-15 18:33:01,250 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1370 transitions. Word has length 16 [2020-10-15 18:33:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:01,251 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 1370 transitions. [2020-10-15 18:33:01,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:33:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1370 transitions. [2020-10-15 18:33:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:33:01,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:01,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:33:01,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:33:01,253 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-15 18:33:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash -658126201, now seen corresponding path program 2 times [2020-10-15 18:33:01,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:01,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621692895] [2020-10-15 18:33:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:01,484 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-15 18:33:01,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621692895] [2020-10-15 18:33:01,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:01,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:33:01,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092043943] [2020-10-15 18:33:01,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:33:01,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:33:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:33:01,486 INFO L87 Difference]: Start difference. First operand 479 states and 1370 transitions. Second operand 8 states. [2020-10-15 18:33:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:01,799 INFO L93 Difference]: Finished difference Result 671 states and 1846 transitions. [2020-10-15 18:33:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:33:01,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-15 18:33:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:01,810 INFO L225 Difference]: With dead ends: 671 [2020-10-15 18:33:01,811 INFO L226 Difference]: Without dead ends: 591 [2020-10-15 18:33:01,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:33:01,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-10-15 18:33:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 465. [2020-10-15 18:33:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-10-15 18:33:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1302 transitions. [2020-10-15 18:33:01,828 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1302 transitions. Word has length 16 [2020-10-15 18:33:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:01,828 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 1302 transitions. [2020-10-15 18:33:01,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:33:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1302 transitions. [2020-10-15 18:33:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:33:01,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:01,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:33:01,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:33:01,830 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-15 18:33:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash -658556729, now seen corresponding path program 1 times [2020-10-15 18:33:01,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:01,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997782883] [2020-10-15 18:33:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:01,946 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-15 18:33:01,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997782883] [2020-10-15 18:33:01,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:01,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:33:01,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032147328] [2020-10-15 18:33:01,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:33:01,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:33:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:33:01,949 INFO L87 Difference]: Start difference. First operand 465 states and 1302 transitions. Second operand 6 states. [2020-10-15 18:33:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:02,092 INFO L93 Difference]: Finished difference Result 743 states and 2057 transitions. [2020-10-15 18:33:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:33:02,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-15 18:33:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:02,096 INFO L225 Difference]: With dead ends: 743 [2020-10-15 18:33:02,097 INFO L226 Difference]: Without dead ends: 565 [2020-10-15 18:33:02,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:33:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-10-15 18:33:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 558. [2020-10-15 18:33:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-10-15 18:33:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1522 transitions. [2020-10-15 18:33:02,111 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1522 transitions. Word has length 16 [2020-10-15 18:33:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:02,111 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 1522 transitions. [2020-10-15 18:33:02,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:33:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1522 transitions. [2020-10-15 18:33:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:33:02,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:02,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:33:02,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:33:02,116 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-15 18:33:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:02,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1563905219, now seen corresponding path program 2 times [2020-10-15 18:33:02,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:02,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114499008] [2020-10-15 18:33:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:02,170 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-15 18:33:02,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114499008] [2020-10-15 18:33:02,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:02,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:33:02,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554227551] [2020-10-15 18:33:02,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:33:02,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:02,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:33:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:33:02,173 INFO L87 Difference]: Start difference. First operand 558 states and 1522 transitions. Second operand 4 states. [2020-10-15 18:33:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:02,205 INFO L93 Difference]: Finished difference Result 770 states and 2059 transitions. [2020-10-15 18:33:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:33:02,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:33:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:02,209 INFO L225 Difference]: With dead ends: 770 [2020-10-15 18:33:02,209 INFO L226 Difference]: Without dead ends: 414 [2020-10-15 18:33:02,210 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-15 18:33:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-15 18:33:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 379. [2020-10-15 18:33:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-10-15 18:33:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 982 transitions. [2020-10-15 18:33:02,222 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 982 transitions. Word has length 16 [2020-10-15 18:33:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:02,222 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 982 transitions. [2020-10-15 18:33:02,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:33:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 982 transitions. [2020-10-15 18:33:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:33:02,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:02,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:33:02,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 18:33:02,224 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-15 18:33:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1070278051, now seen corresponding path program 3 times [2020-10-15 18:33:02,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:02,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101833387] [2020-10-15 18:33:02,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:02,313 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-15 18:33:02,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101833387] [2020-10-15 18:33:02,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:02,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:33:02,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859390128] [2020-10-15 18:33:02,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:33:02,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:33:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:33:02,316 INFO L87 Difference]: Start difference. First operand 379 states and 982 transitions. Second operand 4 states. [2020-10-15 18:33:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:02,354 INFO L93 Difference]: Finished difference Result 372 states and 855 transitions. [2020-10-15 18:33:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:33:02,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:33:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:02,356 INFO L225 Difference]: With dead ends: 372 [2020-10-15 18:33:02,357 INFO L226 Difference]: Without dead ends: 285 [2020-10-15 18:33:02,357 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-15 18:33:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-10-15 18:33:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2020-10-15 18:33:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2020-10-15 18:33:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 650 transitions. [2020-10-15 18:33:02,365 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 650 transitions. Word has length 16 [2020-10-15 18:33:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:02,366 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 650 transitions. [2020-10-15 18:33:02,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:33:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 650 transitions. [2020-10-15 18:33:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:33:02,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:02,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:33:02,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 18:33:02,369 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-15 18:33:02,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:02,369 INFO L82 PathProgramCache]: Analyzing trace with hash -55478072, now seen corresponding path program 1 times [2020-10-15 18:33:02,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:02,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970606462] [2020-10-15 18:33:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:02,434 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-15 18:33:02,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970606462] [2020-10-15 18:33:02,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:02,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:33:02,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874380752] [2020-10-15 18:33:02,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:33:02,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:33:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:33:02,436 INFO L87 Difference]: Start difference. First operand 285 states and 650 transitions. Second operand 5 states. [2020-10-15 18:33:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:02,480 INFO L93 Difference]: Finished difference Result 233 states and 474 transitions. [2020-10-15 18:33:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:33:02,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:33:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:02,482 INFO L225 Difference]: With dead ends: 233 [2020-10-15 18:33:02,482 INFO L226 Difference]: Without dead ends: 185 [2020-10-15 18:33:02,482 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-15 18:33:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-15 18:33:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2020-10-15 18:33:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-15 18:33:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 368 transitions. [2020-10-15 18:33:02,490 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 368 transitions. Word has length 17 [2020-10-15 18:33:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:02,491 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 368 transitions. [2020-10-15 18:33:02,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:33:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 368 transitions. [2020-10-15 18:33:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:33:02,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:02,492 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-15 18:33:02,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 18:33:02,492 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-15 18:33:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash -996306610, now seen corresponding path program 1 times [2020-10-15 18:33:02,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:02,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560808162] [2020-10-15 18:33:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:02,935 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-15 18:33:02,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560808162] [2020-10-15 18:33:02,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:02,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:33:02,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750998251] [2020-10-15 18:33:02,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:33:02,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:33:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:33:02,936 INFO L87 Difference]: Start difference. First operand 185 states and 368 transitions. Second operand 9 states. [2020-10-15 18:33:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:03,327 INFO L93 Difference]: Finished difference Result 197 states and 381 transitions. [2020-10-15 18:33:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:33:03,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-15 18:33:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:03,330 INFO L225 Difference]: With dead ends: 197 [2020-10-15 18:33:03,330 INFO L226 Difference]: Without dead ends: 183 [2020-10-15 18:33:03,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-10-15 18:33:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-15 18:33:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-10-15 18:33:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-15 18:33:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 364 transitions. [2020-10-15 18:33:03,339 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 364 transitions. Word has length 19 [2020-10-15 18:33:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:03,340 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 364 transitions. [2020-10-15 18:33:03,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:33:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 364 transitions. [2020-10-15 18:33:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:33:03,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:03,341 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-15 18:33:03,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 18:33:03,341 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-15 18:33:03,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:03,341 INFO L82 PathProgramCache]: Analyzing trace with hash -952257862, now seen corresponding path program 2 times [2020-10-15 18:33:03,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:03,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186200657] [2020-10-15 18:33:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:03,840 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-15 18:33:03,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186200657] [2020-10-15 18:33:03,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:03,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:33:03,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443345678] [2020-10-15 18:33:03,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:33:03,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:33:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:33:03,843 INFO L87 Difference]: Start difference. First operand 183 states and 364 transitions. Second operand 9 states. [2020-10-15 18:33:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:03,999 INFO L93 Difference]: Finished difference Result 198 states and 382 transitions. [2020-10-15 18:33:04,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:33:04,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-15 18:33:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:04,001 INFO L225 Difference]: With dead ends: 198 [2020-10-15 18:33:04,001 INFO L226 Difference]: Without dead ends: 182 [2020-10-15 18:33:04,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:33:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-15 18:33:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2020-10-15 18:33:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-15 18:33:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 362 transitions. [2020-10-15 18:33:04,006 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 362 transitions. Word has length 19 [2020-10-15 18:33:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:04,006 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 362 transitions. [2020-10-15 18:33:04,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:33:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 362 transitions. [2020-10-15 18:33:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:33:04,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:04,007 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-15 18:33:04,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 18:33:04,008 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-15 18:33:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1744897356, now seen corresponding path program 3 times [2020-10-15 18:33:04,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:04,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822554941] [2020-10-15 18:33:04,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:33:04,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822554941] [2020-10-15 18:33:04,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:04,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:33:04,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978195877] [2020-10-15 18:33:04,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:33:04,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:33:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:33:04,417 INFO L87 Difference]: Start difference. First operand 182 states and 362 transitions. Second operand 9 states. [2020-10-15 18:33:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:04,633 INFO L93 Difference]: Finished difference Result 208 states and 399 transitions. [2020-10-15 18:33:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:33:04,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-15 18:33:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:04,635 INFO L225 Difference]: With dead ends: 208 [2020-10-15 18:33:04,636 INFO L226 Difference]: Without dead ends: 145 [2020-10-15 18:33:04,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:33:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-15 18:33:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2020-10-15 18:33:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-15 18:33:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions. [2020-10-15 18:33:04,640 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19 [2020-10-15 18:33:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:04,641 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 262 transitions. [2020-10-15 18:33:04,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:33:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2020-10-15 18:33:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:33:04,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:04,642 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-15 18:33:04,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 18:33:04,643 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:33:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1136707252, now seen corresponding path program 1 times [2020-10-15 18:33:04,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:04,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230952078] [2020-10-15 18:33:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:33:04,724 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-15 18:33:04,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230952078] [2020-10-15 18:33:04,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:33:04,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:33:04,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675814334] [2020-10-15 18:33:04,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:33:04,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:33:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:33:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:33:04,726 INFO L87 Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states. [2020-10-15 18:33:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:33:04,776 INFO L93 Difference]: Finished difference Result 112 states and 223 transitions. [2020-10-15 18:33:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:33:04,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:33:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:33:04,777 INFO L225 Difference]: With dead ends: 112 [2020-10-15 18:33:04,777 INFO L226 Difference]: Without dead ends: 63 [2020-10-15 18:33:04,778 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-15 18:33:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-15 18:33:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-15 18:33:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-15 18:33:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-15 18:33:04,780 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-15 18:33:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:33:04,780 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-15 18:33:04,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:33:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-15 18:33:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:33:04,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:33:04,781 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-15 18:33:04,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-15 18:33:04,781 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:33:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:33:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash -898304440, now seen corresponding path program 1 times [2020-10-15 18:33:04,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:33:04,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429823237] [2020-10-15 18:33:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:33:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:33:04,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:33:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:33:04,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:33:04,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:33:04,905 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:33:04,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-15 18:33:04,923 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-15 18:33:04,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,924 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-15 18:33:04,924 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,924 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-15 18:33:04,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,925 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-15 18:33:04,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,925 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-15 18:33:04,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,925 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-15 18:33:04,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,926 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-15 18:33:04,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,927 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-15 18:33:04,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,927 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-15 18:33:04,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,927 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-15 18:33:04,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,928 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-15 18:33:04,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,928 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-15 18:33:04,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,929 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-15 18:33:04,929 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,929 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-15 18:33:04,929 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,929 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-15 18:33:04,929 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,930 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-15 18:33:04,930 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,931 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-15 18:33:04,931 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,931 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-15 18:33:04,931 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,931 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-15 18:33:04,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,932 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-15 18:33:04,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,932 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-15 18:33:04,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,933 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-15 18:33:04,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,933 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-15 18:33:04,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,933 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-15 18:33:04,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,934 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-15 18:33:04,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,934 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-15 18:33:04,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,934 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-15 18:33:04,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,935 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-15 18:33:04,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,935 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-15 18:33:04,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,935 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-15 18:33:04,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,936 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-15 18:33:04,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,936 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-15 18:33:04,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,937 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-15 18:33:04,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,937 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-15 18:33:04,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,937 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-15 18:33:04,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:04,938 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-15 18:33:04,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:33:05,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:33:05 BasicIcfg [2020-10-15 18:33:05,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:33:05,023 INFO L168 Benchmark]: Toolchain (without parser) took 20253.32 ms. Allocated memory was 251.7 MB in the beginning and 600.8 MB in the end (delta: 349.2 MB). Free memory was 206.2 MB in the beginning and 295.5 MB in the end (delta: -89.3 MB). Peak memory consumption was 259.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:33:05,024 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:33:05,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.30 ms. Allocated memory was 251.7 MB in the beginning and 314.0 MB in the end (delta: 62.4 MB). Free memory was 206.2 MB in the beginning and 264.3 MB in the end (delta: -58.2 MB). Peak memory consumption was 33.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:33:05,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.76 ms. Allocated memory is still 314.0 MB. Free memory was 264.3 MB in the beginning and 261.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:33:05,025 INFO L168 Benchmark]: Boogie Preprocessor took 38.42 ms. Allocated memory is still 314.0 MB. Free memory was 261.8 MB in the beginning and 259.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:33:05,029 INFO L168 Benchmark]: RCFGBuilder took 2224.90 ms. Allocated memory was 314.0 MB in the beginning and 356.5 MB in the end (delta: 42.5 MB). Free memory was 259.3 MB in the beginning and 181.6 MB in the end (delta: 77.7 MB). Peak memory consumption was 120.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:33:05,030 INFO L168 Benchmark]: TraceAbstraction took 17088.87 ms. Allocated memory was 356.5 MB in the beginning and 600.8 MB in the end (delta: 244.3 MB). Free memory was 181.6 MB in the beginning and 295.5 MB in the end (delta: -113.8 MB). Peak memory consumption was 130.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:33:05,035 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 817.30 ms. Allocated memory was 251.7 MB in the beginning and 314.0 MB in the end (delta: 62.4 MB). Free memory was 206.2 MB in the beginning and 264.3 MB in the end (delta: -58.2 MB). Peak memory consumption was 33.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 78.76 ms. Allocated memory is still 314.0 MB. Free memory was 264.3 MB in the beginning and 261.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.42 ms. Allocated memory is still 314.0 MB. Free memory was 261.8 MB in the beginning and 259.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2224.90 ms. Allocated memory was 314.0 MB in the beginning and 356.5 MB in the end (delta: 42.5 MB). Free memory was 259.3 MB in the beginning and 181.6 MB in the end (delta: 77.7 MB). Peak memory consumption was 120.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17088.87 ms. Allocated memory was 356.5 MB in the beginning and 600.8 MB in the end (delta: 244.3 MB). Free memory was 181.6 MB in the beginning and 295.5 MB in the end (delta: -113.8 MB). Peak memory consumption was 130.5 MB. Max. memory is 14.2 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.1s, 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 t2037; [L808] FCALL, FORK 0 pthread_create(&t2037, ((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 t2038; [L810] FCALL, FORK 0 pthread_create(&t2038, ((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 t2039; [L812] FCALL, FORK 0 pthread_create(&t2039, ((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: 16.8s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 725 SDtfs, 828 SDslu, 1840 SDs, 0 SdLazy, 1126 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 4.6s 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, 26 MinimizatonAttempts, 424 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 75240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...