/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:02:13,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:02:13,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:02:13,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:02:13,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:02:13,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:02:13,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:02:13,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:02:13,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:02:13,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:02:13,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:02:13,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:02:13,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:02:13,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:02:13,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:02:13,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:02:13,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:02:13,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:02:13,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:02:13,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:02:13,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:02:13,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:02:13,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:02:13,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:02:13,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:02:13,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:02:13,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:02:13,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:02:13,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:02:13,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:02:13,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:02:13,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:02:13,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:02:13,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:02:13,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:02:13,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:02:13,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:02:13,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:02:13,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:02:13,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:02:13,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:02:13,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 22:02:13,581 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:02:13,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:02:13,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:02:13,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:02:13,584 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:02:13,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:02:13,584 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:02:13,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:02:13,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:02:13,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:02:13,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:02:13,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:02:13,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:02:13,587 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:02:13,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:02:13,587 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:02:13,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:02:13,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:02:13,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:02:13,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:02:13,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:02:13,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:02:13,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:02:13,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:02:13,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:02:13,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:02:13,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:02:13,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:02:13,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:02:13,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:02:13,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:02:13,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:02:13,931 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:02:13,931 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:02:13,932 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2020-10-15 22:02:14,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4464583e5/e4924a85a4274c289e3b06612e4087c4/FLAG9f63f6ef1 [2020-10-15 22:02:14,559 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:02:14,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2020-10-15 22:02:14,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4464583e5/e4924a85a4274c289e3b06612e4087c4/FLAG9f63f6ef1 [2020-10-15 22:02:14,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4464583e5/e4924a85a4274c289e3b06612e4087c4 [2020-10-15 22:02:14,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:02:14,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:02:14,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:02:14,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:02:14,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:02:14,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:02:14" (1/1) ... [2020-10-15 22:02:14,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478d0378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:14, skipping insertion in model container [2020-10-15 22:02:14,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:02:14" (1/1) ... [2020-10-15 22:02:14,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:02:14,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:02:15,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:02:15,529 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:02:15,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:02:15,716 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:02:15,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15 WrapperNode [2020-10-15 22:02:15,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:02:15,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:02:15,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:02:15,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:02:15,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:02:15,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:02:15,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:02:15,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:02:15,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (1/1) ... [2020-10-15 22:02:15,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:02:15,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:02:15,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:02:15,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:02:15,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (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 22:02:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:02:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:02:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:02:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:02:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:02:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:02:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:02:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:02:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 22:02:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 22:02:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 22:02:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 22:02:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:02:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:02:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:02:15,900 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 22:02:18,078 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:02:18,078 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:02:18,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:02:18 BoogieIcfgContainer [2020-10-15 22:02:18,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:02:18,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:02:18,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:02:18,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:02:18,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:02:14" (1/3) ... [2020-10-15 22:02:18,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b21fe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:02:18, skipping insertion in model container [2020-10-15 22:02:18,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:02:15" (2/3) ... [2020-10-15 22:02:18,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b21fe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:02:18, skipping insertion in model container [2020-10-15 22:02:18,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:02:18" (3/3) ... [2020-10-15 22:02:18,091 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2020-10-15 22:02:18,103 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:02:18,103 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:02:18,112 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:02:18,113 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:02:18,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,145 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,152 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,153 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,156 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,156 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,171 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,172 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,177 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,178 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:02:18,198 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 22:02:18,220 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:02:18,221 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:02:18,221 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:02:18,221 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:02:18,221 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:02:18,221 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:02:18,221 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:02:18,222 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:02:18,236 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:02:18,239 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-15 22:02:18,242 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-15 22:02:18,244 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-15 22:02:18,297 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-15 22:02:18,297 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:02:18,304 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-15 22:02:18,308 INFO L117 LiptonReduction]: Number of co-enabled transitions 2606 [2020-10-15 22:02:18,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:18,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:18,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:18,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:18,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:19,283 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 22:02:19,425 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 22:02:19,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:02:19,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:19,717 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 22:02:19,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:19,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:19,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:19,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:19,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:19,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:19,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:19,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:19,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:19,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:19,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:19,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:19,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:19,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:19,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:19,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:19,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:02:19,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:19,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-15 22:02:19,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:19,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 22:02:19,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:19,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:02:19,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:21,083 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-15 22:02:21,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-15 22:02:21,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:21,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 22:02:21,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:02:21,944 WARN L193 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-15 22:02:21,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:21,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:21,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:21,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:21,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:21,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:21,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:21,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:21,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:21,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:21,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:21,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:21,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:21,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:22,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:22,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:22,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:22,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:22,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:22,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:22,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:22,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:22,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:22,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:22,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:22,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:22,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:22,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:22,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:22,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:22,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:22,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:22,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:02:22,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:22,605 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 22:02:23,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:23,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:02:23,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:02:23,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:02:23,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:02:23,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:02:24,075 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-15 22:02:24,213 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-15 22:02:24,225 INFO L132 LiptonReduction]: Checked pairs total: 7344 [2020-10-15 22:02:24,226 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-15 22:02:24,233 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-10-15 22:02:24,588 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-10-15 22:02:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-10-15 22:02:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 22:02:24,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:24,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 22:02:24,602 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1140669396, now seen corresponding path program 1 times [2020-10-15 22:02:24,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:24,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113177660] [2020-10-15 22:02:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:24,850 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 22:02:24,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113177660] [2020-10-15 22:02:24,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:24,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:02:24,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254063023] [2020-10-15 22:02:24,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:02:24,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:02:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:02:24,873 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-10-15 22:02:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:25,038 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-15 22:02:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:02:25,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 22:02:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:25,101 INFO L225 Difference]: With dead ends: 4062 [2020-10-15 22:02:25,101 INFO L226 Difference]: Without dead ends: 3437 [2020-10-15 22:02:25,103 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 22:02:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-10-15 22:02:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2020-10-15 22:02:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3437 states. [2020-10-15 22:02:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 13500 transitions. [2020-10-15 22:02:25,342 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 13500 transitions. Word has length 5 [2020-10-15 22:02:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:25,343 INFO L481 AbstractCegarLoop]: Abstraction has 3437 states and 13500 transitions. [2020-10-15 22:02:25,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:02:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 13500 transitions. [2020-10-15 22:02:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:02:25,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:25,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:25,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:02:25,348 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1823462933, now seen corresponding path program 1 times [2020-10-15 22:02:25,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:25,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334068616] [2020-10-15 22:02:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:25,525 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 22:02:25,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334068616] [2020-10-15 22:02:25,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:25,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:02:25,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643481992] [2020-10-15 22:02:25,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:02:25,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:02:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:02:25,529 INFO L87 Difference]: Start difference. First operand 3437 states and 13500 transitions. Second operand 4 states. [2020-10-15 22:02:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:25,665 INFO L93 Difference]: Finished difference Result 4042 states and 15414 transitions. [2020-10-15 22:02:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:02:25,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 22:02:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:25,697 INFO L225 Difference]: With dead ends: 4042 [2020-10-15 22:02:25,697 INFO L226 Difference]: Without dead ends: 3417 [2020-10-15 22:02:25,698 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 22:02:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2020-10-15 22:02:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3417. [2020-10-15 22:02:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2020-10-15 22:02:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 13404 transitions. [2020-10-15 22:02:25,836 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 13404 transitions. Word has length 12 [2020-10-15 22:02:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:25,838 INFO L481 AbstractCegarLoop]: Abstraction has 3417 states and 13404 transitions. [2020-10-15 22:02:25,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:02:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 13404 transitions. [2020-10-15 22:02:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:02:25,842 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:25,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:25,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:02:25,842 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2103288409, now seen corresponding path program 1 times [2020-10-15 22:02:25,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:25,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627275603] [2020-10-15 22:02:25,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:26,183 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 22:02:26,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627275603] [2020-10-15 22:02:26,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:26,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:26,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964682437] [2020-10-15 22:02:26,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:02:26,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:26,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:02:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:02:26,185 INFO L87 Difference]: Start difference. First operand 3417 states and 13404 transitions. Second operand 6 states. [2020-10-15 22:02:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:26,417 INFO L93 Difference]: Finished difference Result 3901 states and 14907 transitions. [2020-10-15 22:02:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:26,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-15 22:02:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:26,447 INFO L225 Difference]: With dead ends: 3901 [2020-10-15 22:02:26,447 INFO L226 Difference]: Without dead ends: 3401 [2020-10-15 22:02:26,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-10-15 22:02:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3401. [2020-10-15 22:02:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2020-10-15 22:02:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 13324 transitions. [2020-10-15 22:02:26,569 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 13324 transitions. Word has length 13 [2020-10-15 22:02:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:26,569 INFO L481 AbstractCegarLoop]: Abstraction has 3401 states and 13324 transitions. [2020-10-15 22:02:26,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:02:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 13324 transitions. [2020-10-15 22:02:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:02:26,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:26,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:26,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:02:26,572 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash -692776307, now seen corresponding path program 1 times [2020-10-15 22:02:26,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:26,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464327698] [2020-10-15 22:02:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:26,677 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 22:02:26,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464327698] [2020-10-15 22:02:26,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:26,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:02:26,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475704685] [2020-10-15 22:02:26,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:02:26,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:02:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:26,679 INFO L87 Difference]: Start difference. First operand 3401 states and 13324 transitions. Second operand 5 states. [2020-10-15 22:02:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:26,813 INFO L93 Difference]: Finished difference Result 3884 states and 14770 transitions. [2020-10-15 22:02:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:02:26,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 22:02:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:26,844 INFO L225 Difference]: With dead ends: 3884 [2020-10-15 22:02:26,844 INFO L226 Difference]: Without dead ends: 3309 [2020-10-15 22:02:26,844 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 22:02:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2020-10-15 22:02:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 3309. [2020-10-15 22:02:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3309 states. [2020-10-15 22:02:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 12904 transitions. [2020-10-15 22:02:26,950 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 12904 transitions. Word has length 13 [2020-10-15 22:02:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:26,951 INFO L481 AbstractCegarLoop]: Abstraction has 3309 states and 12904 transitions. [2020-10-15 22:02:26,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:02:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 12904 transitions. [2020-10-15 22:02:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:02:26,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:26,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:26,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:02:26,955 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:26,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:26,955 INFO L82 PathProgramCache]: Analyzing trace with hash 777431007, now seen corresponding path program 1 times [2020-10-15 22:02:26,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:26,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366542534] [2020-10-15 22:02:26,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:27,135 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 22:02:27,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366542534] [2020-10-15 22:02:27,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:27,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:27,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093212739] [2020-10-15 22:02:27,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:02:27,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:02:27,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:02:27,138 INFO L87 Difference]: Start difference. First operand 3309 states and 12904 transitions. Second operand 6 states. [2020-10-15 22:02:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:27,330 INFO L93 Difference]: Finished difference Result 3985 states and 15197 transitions. [2020-10-15 22:02:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:27,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-15 22:02:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:27,349 INFO L225 Difference]: With dead ends: 3985 [2020-10-15 22:02:27,350 INFO L226 Difference]: Without dead ends: 3461 [2020-10-15 22:02:27,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2020-10-15 22:02:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3461. [2020-10-15 22:02:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3461 states. [2020-10-15 22:02:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3461 states to 3461 states and 13456 transitions. [2020-10-15 22:02:27,549 INFO L78 Accepts]: Start accepts. Automaton has 3461 states and 13456 transitions. Word has length 14 [2020-10-15 22:02:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:27,550 INFO L481 AbstractCegarLoop]: Abstraction has 3461 states and 13456 transitions. [2020-10-15 22:02:27,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:02:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 13456 transitions. [2020-10-15 22:02:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:02:27,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:27,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:27,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:02:27,554 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1962759615, now seen corresponding path program 1 times [2020-10-15 22:02:27,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:27,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656334149] [2020-10-15 22:02:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:27,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656334149] [2020-10-15 22:02:27,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:27,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:02:27,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118167669] [2020-10-15 22:02:27,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:02:27,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:27,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:02:27,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:27,621 INFO L87 Difference]: Start difference. First operand 3461 states and 13456 transitions. Second operand 5 states. [2020-10-15 22:02:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:27,758 INFO L93 Difference]: Finished difference Result 3797 states and 14419 transitions. [2020-10-15 22:02:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:27,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 22:02:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:27,779 INFO L225 Difference]: With dead ends: 3797 [2020-10-15 22:02:27,780 INFO L226 Difference]: Without dead ends: 3397 [2020-10-15 22:02:27,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2020-10-15 22:02:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3397. [2020-10-15 22:02:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3397 states. [2020-10-15 22:02:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 13172 transitions. [2020-10-15 22:02:27,898 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 13172 transitions. Word has length 15 [2020-10-15 22:02:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:27,899 INFO L481 AbstractCegarLoop]: Abstraction has 3397 states and 13172 transitions. [2020-10-15 22:02:27,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:02:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 13172 transitions. [2020-10-15 22:02:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:02:27,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:27,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:27,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:02:27,905 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -463857035, now seen corresponding path program 1 times [2020-10-15 22:02:27,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:27,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288890182] [2020-10-15 22:02:27,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:28,028 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 22:02:28,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288890182] [2020-10-15 22:02:28,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:28,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:28,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964255156] [2020-10-15 22:02:28,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:02:28,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:02:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:02:28,031 INFO L87 Difference]: Start difference. First operand 3397 states and 13172 transitions. Second operand 6 states. [2020-10-15 22:02:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:28,185 INFO L93 Difference]: Finished difference Result 3604 states and 13703 transitions. [2020-10-15 22:02:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:28,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 22:02:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:28,198 INFO L225 Difference]: With dead ends: 3604 [2020-10-15 22:02:28,199 INFO L226 Difference]: Without dead ends: 3259 [2020-10-15 22:02:28,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2020-10-15 22:02:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 3259. [2020-10-15 22:02:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3259 states. [2020-10-15 22:02:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 12588 transitions. [2020-10-15 22:02:28,289 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 12588 transitions. Word has length 15 [2020-10-15 22:02:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:28,289 INFO L481 AbstractCegarLoop]: Abstraction has 3259 states and 12588 transitions. [2020-10-15 22:02:28,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:02:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 12588 transitions. [2020-10-15 22:02:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:28,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:28,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:28,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:02:28,294 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash -716006153, now seen corresponding path program 1 times [2020-10-15 22:02:28,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:28,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644701036] [2020-10-15 22:02:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:28,527 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 22:02:28,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644701036] [2020-10-15 22:02:28,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:28,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:02:28,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703914341] [2020-10-15 22:02:28,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:02:28,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:02:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:28,529 INFO L87 Difference]: Start difference. First operand 3259 states and 12588 transitions. Second operand 7 states. [2020-10-15 22:02:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:28,790 INFO L93 Difference]: Finished difference Result 3802 states and 14537 transitions. [2020-10-15 22:02:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:02:28,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 22:02:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:28,804 INFO L225 Difference]: With dead ends: 3802 [2020-10-15 22:02:28,805 INFO L226 Difference]: Without dead ends: 3494 [2020-10-15 22:02:28,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2020-10-15 22:02:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2020-10-15 22:02:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2020-10-15 22:02:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 13560 transitions. [2020-10-15 22:02:29,022 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 13560 transitions. Word has length 16 [2020-10-15 22:02:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:29,022 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 13560 transitions. [2020-10-15 22:02:29,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:02:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 13560 transitions. [2020-10-15 22:02:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:29,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:29,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:29,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:02:29,028 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1494726011, now seen corresponding path program 2 times [2020-10-15 22:02:29,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:29,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320202761] [2020-10-15 22:02:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:29,260 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 22:02:29,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320202761] [2020-10-15 22:02:29,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:29,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:02:29,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540197423] [2020-10-15 22:02:29,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:02:29,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:29,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:02:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:29,263 INFO L87 Difference]: Start difference. First operand 3494 states and 13560 transitions. Second operand 7 states. [2020-10-15 22:02:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:29,482 INFO L93 Difference]: Finished difference Result 3868 states and 14771 transitions. [2020-10-15 22:02:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:02:29,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 22:02:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:29,495 INFO L225 Difference]: With dead ends: 3868 [2020-10-15 22:02:29,495 INFO L226 Difference]: Without dead ends: 3560 [2020-10-15 22:02:29,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2020-10-15 22:02:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3485. [2020-10-15 22:02:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2020-10-15 22:02:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 13524 transitions. [2020-10-15 22:02:29,622 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 13524 transitions. Word has length 16 [2020-10-15 22:02:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:29,623 INFO L481 AbstractCegarLoop]: Abstraction has 3485 states and 13524 transitions. [2020-10-15 22:02:29,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:02:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 13524 transitions. [2020-10-15 22:02:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:29,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:29,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:29,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:02:29,629 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:29,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1686175225, now seen corresponding path program 3 times [2020-10-15 22:02:29,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:29,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506944906] [2020-10-15 22:02:29,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:29,838 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 22:02:29,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506944906] [2020-10-15 22:02:29,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:29,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:02:29,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533693495] [2020-10-15 22:02:29,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:02:29,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:29,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:02:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:29,839 INFO L87 Difference]: Start difference. First operand 3485 states and 13524 transitions. Second operand 7 states. [2020-10-15 22:02:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:30,105 INFO L93 Difference]: Finished difference Result 4685 states and 17837 transitions. [2020-10-15 22:02:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:02:30,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 22:02:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:30,116 INFO L225 Difference]: With dead ends: 4685 [2020-10-15 22:02:30,117 INFO L226 Difference]: Without dead ends: 4239 [2020-10-15 22:02:30,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:02:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2020-10-15 22:02:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 3857. [2020-10-15 22:02:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3857 states. [2020-10-15 22:02:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 14787 transitions. [2020-10-15 22:02:30,237 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 14787 transitions. Word has length 16 [2020-10-15 22:02:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:30,237 INFO L481 AbstractCegarLoop]: Abstraction has 3857 states and 14787 transitions. [2020-10-15 22:02:30,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:02:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 14787 transitions. [2020-10-15 22:02:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:02:30,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:30,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:30,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:02:30,244 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:30,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1913500098, now seen corresponding path program 1 times [2020-10-15 22:02:30,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:30,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922354135] [2020-10-15 22:02:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:30,307 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 22:02:30,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922354135] [2020-10-15 22:02:30,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:30,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:02:30,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65547749] [2020-10-15 22:02:30,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:02:30,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:02:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:02:30,309 INFO L87 Difference]: Start difference. First operand 3857 states and 14787 transitions. Second operand 4 states. [2020-10-15 22:02:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:30,358 INFO L93 Difference]: Finished difference Result 3784 states and 13202 transitions. [2020-10-15 22:02:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:02:30,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 22:02:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:30,364 INFO L225 Difference]: With dead ends: 3784 [2020-10-15 22:02:30,364 INFO L226 Difference]: Without dead ends: 2913 [2020-10-15 22:02:30,365 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 22:02:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-10-15 22:02:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2913. [2020-10-15 22:02:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2020-10-15 22:02:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 10067 transitions. [2020-10-15 22:02:30,444 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 10067 transitions. Word has length 16 [2020-10-15 22:02:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:30,444 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 10067 transitions. [2020-10-15 22:02:30,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:02:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 10067 transitions. [2020-10-15 22:02:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:02:30,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:30,452 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 22:02:30,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:02:30,453 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash -403765714, now seen corresponding path program 1 times [2020-10-15 22:02:30,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:30,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479400866] [2020-10-15 22:02:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:30,672 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 22:02:30,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479400866] [2020-10-15 22:02:30,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:30,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:30,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809115112] [2020-10-15 22:02:30,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:02:30,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:02:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:30,675 INFO L87 Difference]: Start difference. First operand 2913 states and 10067 transitions. Second operand 5 states. [2020-10-15 22:02:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:30,732 INFO L93 Difference]: Finished difference Result 2298 states and 7288 transitions. [2020-10-15 22:02:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:02:30,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 22:02:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:30,737 INFO L225 Difference]: With dead ends: 2298 [2020-10-15 22:02:30,738 INFO L226 Difference]: Without dead ends: 1773 [2020-10-15 22:02:30,738 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 22:02:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2020-10-15 22:02:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1575. [2020-10-15 22:02:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-10-15 22:02:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 4826 transitions. [2020-10-15 22:02:30,775 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 4826 transitions. Word has length 17 [2020-10-15 22:02:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:30,776 INFO L481 AbstractCegarLoop]: Abstraction has 1575 states and 4826 transitions. [2020-10-15 22:02:30,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:02:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 4826 transitions. [2020-10-15 22:02:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 22:02:30,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:30,780 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] [2020-10-15 22:02:30,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:02:30,781 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash -952435206, now seen corresponding path program 1 times [2020-10-15 22:02:30,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:30,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904087198] [2020-10-15 22:02:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:30,859 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 22:02:30,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904087198] [2020-10-15 22:02:30,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:30,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:02:30,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740525703] [2020-10-15 22:02:30,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:02:30,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:02:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:02:30,862 INFO L87 Difference]: Start difference. First operand 1575 states and 4826 transitions. Second operand 4 states. [2020-10-15 22:02:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:30,899 INFO L93 Difference]: Finished difference Result 2327 states and 6911 transitions. [2020-10-15 22:02:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:02:30,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-15 22:02:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:30,904 INFO L225 Difference]: With dead ends: 2327 [2020-10-15 22:02:30,905 INFO L226 Difference]: Without dead ends: 1621 [2020-10-15 22:02:30,905 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 22:02:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2020-10-15 22:02:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1555. [2020-10-15 22:02:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-10-15 22:02:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 4626 transitions. [2020-10-15 22:02:30,946 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 4626 transitions. Word has length 20 [2020-10-15 22:02:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:30,947 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 4626 transitions. [2020-10-15 22:02:30,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:02:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 4626 transitions. [2020-10-15 22:02:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 22:02:30,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:30,951 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] [2020-10-15 22:02:30,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:02:30,951 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:30,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash -156833564, now seen corresponding path program 1 times [2020-10-15 22:02:30,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:30,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183344003] [2020-10-15 22:02:30,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:31,088 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 22:02:31,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183344003] [2020-10-15 22:02:31,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:31,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:02:31,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548262183] [2020-10-15 22:02:31,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:02:31,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:31,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:02:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:02:31,091 INFO L87 Difference]: Start difference. First operand 1555 states and 4626 transitions. Second operand 6 states. [2020-10-15 22:02:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:31,150 INFO L93 Difference]: Finished difference Result 1300 states and 3833 transitions. [2020-10-15 22:02:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:02:31,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-15 22:02:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:31,154 INFO L225 Difference]: With dead ends: 1300 [2020-10-15 22:02:31,155 INFO L226 Difference]: Without dead ends: 1151 [2020-10-15 22:02:31,156 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 22:02:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2020-10-15 22:02:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1031. [2020-10-15 22:02:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2020-10-15 22:02:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 3094 transitions. [2020-10-15 22:02:31,179 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 3094 transitions. Word has length 20 [2020-10-15 22:02:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:31,180 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 3094 transitions. [2020-10-15 22:02:31,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:02:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 3094 transitions. [2020-10-15 22:02:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 22:02:31,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:31,184 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, 1, 1] [2020-10-15 22:02:31,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 22:02:31,184 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:31,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2113618509, now seen corresponding path program 1 times [2020-10-15 22:02:31,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:31,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518779676] [2020-10-15 22:02:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:31,270 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 22:02:31,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518779676] [2020-10-15 22:02:31,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:31,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:02:31,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844340728] [2020-10-15 22:02:31,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:02:31,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:02:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:02:31,272 INFO L87 Difference]: Start difference. First operand 1031 states and 3094 transitions. Second operand 5 states. [2020-10-15 22:02:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:31,323 INFO L93 Difference]: Finished difference Result 1408 states and 4095 transitions. [2020-10-15 22:02:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:02:31,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-15 22:02:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:31,325 INFO L225 Difference]: With dead ends: 1408 [2020-10-15 22:02:31,326 INFO L226 Difference]: Without dead ends: 997 [2020-10-15 22:02:31,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-10-15 22:02:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 991. [2020-10-15 22:02:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-10-15 22:02:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2860 transitions. [2020-10-15 22:02:31,349 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2860 transitions. Word has length 24 [2020-10-15 22:02:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:31,350 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 2860 transitions. [2020-10-15 22:02:31,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:02:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2860 transitions. [2020-10-15 22:02:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 22:02:31,356 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:31,356 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, 1, 1] [2020-10-15 22:02:31,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 22:02:31,356 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:31,357 INFO L82 PathProgramCache]: Analyzing trace with hash 720683188, now seen corresponding path program 1 times [2020-10-15 22:02:31,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:31,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876015282] [2020-10-15 22:02:31,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:31,509 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 22:02:31,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876015282] [2020-10-15 22:02:31,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:31,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:02:31,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347818286] [2020-10-15 22:02:31,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:02:31,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:02:31,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:02:31,513 INFO L87 Difference]: Start difference. First operand 991 states and 2860 transitions. Second operand 7 states. [2020-10-15 22:02:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:31,584 INFO L93 Difference]: Finished difference Result 945 states and 2768 transitions. [2020-10-15 22:02:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:02:31,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-15 22:02:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:31,585 INFO L225 Difference]: With dead ends: 945 [2020-10-15 22:02:31,586 INFO L226 Difference]: Without dead ends: 357 [2020-10-15 22:02:31,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:02:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-10-15 22:02:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 333. [2020-10-15 22:02:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-15 22:02:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 908 transitions. [2020-10-15 22:02:31,594 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 908 transitions. Word has length 24 [2020-10-15 22:02:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:31,594 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 908 transitions. [2020-10-15 22:02:31,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:02:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 908 transitions. [2020-10-15 22:02:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-15 22:02:31,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:31,596 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, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:31,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 22:02:31,596 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1893152963, now seen corresponding path program 1 times [2020-10-15 22:02:31,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:31,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496089673] [2020-10-15 22:02:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:02:32,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496089673] [2020-10-15 22:02:32,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:32,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 22:02:32,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119811138] [2020-10-15 22:02:32,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 22:02:32,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:32,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 22:02:32,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-15 22:02:32,445 INFO L87 Difference]: Start difference. First operand 333 states and 908 transitions. Second operand 10 states. [2020-10-15 22:02:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:33,027 INFO L93 Difference]: Finished difference Result 570 states and 1518 transitions. [2020-10-15 22:02:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 22:02:33,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-15 22:02:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:33,029 INFO L225 Difference]: With dead ends: 570 [2020-10-15 22:02:33,029 INFO L226 Difference]: Without dead ends: 421 [2020-10-15 22:02:33,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-15 22:02:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-15 22:02:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 337. [2020-10-15 22:02:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-10-15 22:02:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 896 transitions. [2020-10-15 22:02:33,043 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 896 transitions. Word has length 28 [2020-10-15 22:02:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:33,043 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 896 transitions. [2020-10-15 22:02:33,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 22:02:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 896 transitions. [2020-10-15 22:02:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-15 22:02:33,047 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:33,047 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, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:33,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 22:02:33,047 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash 84648489, now seen corresponding path program 2 times [2020-10-15 22:02:33,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:33,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384265385] [2020-10-15 22:02:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:02:33,771 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 22:02:33,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384265385] [2020-10-15 22:02:33,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:02:33,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 22:02:33,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877115147] [2020-10-15 22:02:33,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 22:02:33,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:02:33,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 22:02:33,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:02:33,779 INFO L87 Difference]: Start difference. First operand 337 states and 896 transitions. Second operand 11 states. [2020-10-15 22:02:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:02:34,115 INFO L93 Difference]: Finished difference Result 392 states and 1029 transitions. [2020-10-15 22:02:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 22:02:34,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-10-15 22:02:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:02:34,117 INFO L225 Difference]: With dead ends: 392 [2020-10-15 22:02:34,117 INFO L226 Difference]: Without dead ends: 305 [2020-10-15 22:02:34,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-15 22:02:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-10-15 22:02:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 257. [2020-10-15 22:02:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-10-15 22:02:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 684 transitions. [2020-10-15 22:02:34,124 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 684 transitions. Word has length 28 [2020-10-15 22:02:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:02:34,125 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 684 transitions. [2020-10-15 22:02:34,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 22:02:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 684 transitions. [2020-10-15 22:02:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-15 22:02:34,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:02:34,126 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, 1, 1, 1, 1, 1, 1] [2020-10-15 22:02:34,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 22:02:34,126 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:02:34,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:02:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1105278155, now seen corresponding path program 3 times [2020-10-15 22:02:34,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:02:34,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775115616] [2020-10-15 22:02:34,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:02:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:02:34,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:02:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:02:34,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:02:34,344 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:02:34,345 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:02:34,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 22:02:34,376 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 22:02:34,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,380 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 22:02:34,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,381 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 22:02:34,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,381 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 22:02:34,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,381 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 22:02:34,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,382 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 22:02:34,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,384 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 22:02:34,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,384 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 22:02:34,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,385 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 22:02:34,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,385 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 22:02:34,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,386 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 22:02:34,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,386 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 22:02:34,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,386 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 22:02:34,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,387 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 22:02:34,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,387 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 22:02:34,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,387 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 22:02:34,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,388 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 22:02:34,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,388 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 22:02:34,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,393 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 22:02:34,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,394 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 22:02:34,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,394 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 22:02:34,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,394 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 22:02:34,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,396 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 22:02:34,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,397 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 22:02:34,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,397 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 22:02:34,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,397 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 22:02:34,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,397 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 22:02:34,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,398 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 22:02:34,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,398 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 22:02:34,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,398 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 22:02:34,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,399 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 22:02:34,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,399 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 22:02:34,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,399 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 22:02:34,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,399 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 22:02:34,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,400 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 22:02:34,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,400 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 22:02:34,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,400 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 22:02:34,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,401 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 22:02:34,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,401 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 22:02:34,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,401 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 22:02:34,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,402 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 22:02:34,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:02:34,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:02:34 BasicIcfg [2020-10-15 22:02:34,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:02:34,523 INFO L168 Benchmark]: Toolchain (without parser) took 19716.07 ms. Allocated memory was 255.9 MB in the beginning and 691.0 MB in the end (delta: 435.2 MB). Free memory was 211.6 MB in the beginning and 302.3 MB in the end (delta: -90.7 MB). Peak memory consumption was 344.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:34,524 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 255.9 MB. Free memory is still 232.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:02:34,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 909.14 ms. Allocated memory was 255.9 MB in the beginning and 331.9 MB in the end (delta: 76.0 MB). Free memory was 211.6 MB in the beginning and 277.5 MB in the end (delta: -65.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:34,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 331.9 MB. Free memory was 277.5 MB in the beginning and 275.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:34,526 INFO L168 Benchmark]: Boogie Preprocessor took 41.22 ms. Allocated memory is still 331.9 MB. Free memory was 275.0 MB in the beginning and 272.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:34,526 INFO L168 Benchmark]: RCFGBuilder took 2260.31 ms. Allocated memory was 331.9 MB in the beginning and 382.7 MB in the end (delta: 50.9 MB). Free memory was 272.4 MB in the beginning and 342.0 MB in the end (delta: -69.5 MB). Peak memory consumption was 129.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:34,527 INFO L168 Benchmark]: TraceAbstraction took 16436.04 ms. Allocated memory was 382.7 MB in the beginning and 691.0 MB in the end (delta: 308.3 MB). Free memory was 338.5 MB in the beginning and 302.3 MB in the end (delta: 36.2 MB). Peak memory consumption was 344.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:02:34,535 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.23 ms. Allocated memory is still 255.9 MB. Free memory is still 232.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 909.14 ms. Allocated memory was 255.9 MB in the beginning and 331.9 MB in the end (delta: 76.0 MB). Free memory was 211.6 MB in the beginning and 277.5 MB in the end (delta: -65.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 331.9 MB. Free memory was 277.5 MB in the beginning and 275.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.22 ms. Allocated memory is still 331.9 MB. Free memory was 275.0 MB in the beginning and 272.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2260.31 ms. Allocated memory was 331.9 MB in the beginning and 382.7 MB in the end (delta: 50.9 MB). Free memory was 272.4 MB in the beginning and 342.0 MB in the end (delta: -69.5 MB). Peak memory consumption was 129.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 16436.04 ms. Allocated memory was 382.7 MB in the beginning and 691.0 MB in the end (delta: 308.3 MB). Free memory was 338.5 MB in the beginning and 302.3 MB in the end (delta: 36.2 MB). Peak memory consumption was 344.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1785 VarBasedMoverChecksPositive, 93 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 260 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.9s, 121 PlacesBefore, 47 PlacesAfterwards, 110 TransitionsBefore, 35 TransitionsAfterwards, 2606 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 7344 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L710] 0 _Bool x$flush_delayed; [L711] 0 int x$mem_tmp; [L712] 0 _Bool x$r_buff0_thd0; [L713] 0 _Bool x$r_buff0_thd1; [L714] 0 _Bool x$r_buff0_thd2; [L715] 0 _Bool x$r_buff0_thd3; [L716] 0 _Bool x$r_buff0_thd4; [L717] 0 _Bool x$r_buff1_thd0; [L718] 0 _Bool x$r_buff1_thd1; [L719] 0 _Bool x$r_buff1_thd2; [L720] 0 _Bool x$r_buff1_thd3; [L721] 0 _Bool x$r_buff1_thd4; [L722] 0 _Bool x$read_delayed; [L723] 0 int *x$read_delayed_var; [L724] 0 int x$w_buff0; [L725] 0 _Bool x$w_buff0_used; [L726] 0 int x$w_buff1; [L727] 0 _Bool x$w_buff1_used; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1481; [L836] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1482; [L838] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 2 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L766] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L767] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t1483; [L840] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L793] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L794] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L797] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L841] 0 pthread_t t1484; [L842] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L810] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L737] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L740] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L813] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L813] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L814] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L814] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L815] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L816] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L817] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L817] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L850] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L852] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 x$flush_delayed = weak$$choice2 [L858] 0 x$mem_tmp = x [L859] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L859] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L860] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L860] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L861] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L862] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L862] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L864] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L864] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L864] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L867] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L867] 0 x = x$flush_delayed ? x$mem_tmp : x [L868] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 757 SDtfs, 1084 SDslu, 1833 SDs, 0 SdLazy, 874 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1003 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 84072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...