/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:28:39,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:28:39,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:28:39,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:28:39,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:28:39,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:28:39,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:28:39,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:28:39,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:28:39,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:28:39,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:28:39,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:28:39,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:28:39,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:28:39,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:28:39,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:28:39,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:28:39,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:28:39,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:28:39,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:28:39,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:28:39,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:28:39,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:28:39,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:28:39,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:28:39,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:28:39,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:28:39,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:28:39,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:28:39,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:28:39,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:28:39,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:28:39,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:28:39,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:28:39,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:28:39,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:28:39,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:28:39,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:28:39,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:28:39,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:28:39,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:28:39,751 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-MCR.epf [2019-12-27 17:28:39,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:28:39,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:28:39,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:28:39,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:28:39,787 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:28:39,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:28:39,787 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:28:39,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:28:39,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:28:39,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:28:39,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:28:39,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:28:39,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:28:39,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:28:39,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:28:39,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:28:39,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:28:39,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:28:39,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:28:39,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:28:39,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:28:39,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:28:39,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:28:39,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:28:39,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:28:39,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:28:39,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:28:39,793 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:28:39,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:28:39,794 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:28:39,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:28:40,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:28:40,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:28:40,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:28:40,137 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:28:40,137 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:28:40,138 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-27 17:28:40,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed4e4f2/ea36fc1859c945f2977012b0db749b24/FLAG1a3bbfa92 [2019-12-27 17:28:40,779 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:28:40,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-27 17:28:40,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed4e4f2/ea36fc1859c945f2977012b0db749b24/FLAG1a3bbfa92 [2019-12-27 17:28:41,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed4e4f2/ea36fc1859c945f2977012b0db749b24 [2019-12-27 17:28:41,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:28:41,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:28:41,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:28:41,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:28:41,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:28:41,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7c94ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41, skipping insertion in model container [2019-12-27 17:28:41,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:28:41,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:28:41,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:28:41,693 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:28:41,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:28:41,831 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:28:41,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41 WrapperNode [2019-12-27 17:28:41,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:28:41,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:28:41,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:28:41,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:28:41,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:28:41,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:28:41,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:28:41,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:28:41,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (1/1) ... [2019-12-27 17:28:41,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:28:41,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:28:41,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:28:41,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:28:41,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (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 [2019-12-27 17:28:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:28:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:28:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:28:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:28:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:28:42,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:28:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:28:42,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:28:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:28:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:28:42,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:28:42,015 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:28:42,735 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:28:42,735 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:28:42,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:28:42 BoogieIcfgContainer [2019-12-27 17:28:42,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:28:42,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:28:42,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:28:42,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:28:42,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:28:41" (1/3) ... [2019-12-27 17:28:42,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490cbf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:28:42, skipping insertion in model container [2019-12-27 17:28:42,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:41" (2/3) ... [2019-12-27 17:28:42,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490cbf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:28:42, skipping insertion in model container [2019-12-27 17:28:42,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:28:42" (3/3) ... [2019-12-27 17:28:42,748 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2019-12-27 17:28:42,760 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:28:42,760 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:28:42,772 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:28:42,774 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:28:42,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,839 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:42,884 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:28:42,906 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:28:42,906 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:28:42,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:28:42,906 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:28:42,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:28:42,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:28:42,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:28:42,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:28:42,923 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 17:28:42,925 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 17:28:43,030 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 17:28:43,030 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:28:43,043 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:28:43,060 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 17:28:43,104 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 17:28:43,104 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:28:43,109 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:28:43,122 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 17:28:43,123 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:28:47,382 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 17:28:47,510 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-27 17:28:47,510 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 17:28:47,514 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 17:28:47,933 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-27 17:28:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-27 17:28:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:28:47,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:47,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:28:47,944 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-27 17:28:47,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:47,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417297652] [2019-12-27 17:28:47,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:48,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417297652] [2019-12-27 17:28:48,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:48,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:28:48,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609555020] [2019-12-27 17:28:48,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:48,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:48,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:28:48,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:48,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:48,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:48,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:48,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:48,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:48,253 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-27 17:28:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:48,535 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-27 17:28:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:48,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:28:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:48,636 INFO L225 Difference]: With dead ends: 8377 [2019-12-27 17:28:48,637 INFO L226 Difference]: Without dead ends: 8208 [2019-12-27 17:28:48,638 INFO L631 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 [2019-12-27 17:28:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-27 17:28:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-27 17:28:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-27 17:28:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-27 17:28:49,034 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-27 17:28:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:49,035 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-27 17:28:49,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-27 17:28:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:28:49,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:49,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:49,038 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-27 17:28:49,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:49,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726251880] [2019-12-27 17:28:49,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:49,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726251880] [2019-12-27 17:28:49,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:49,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:49,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1835161717] [2019-12-27 17:28:49,125 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:49,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:49,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:28:49,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:49,128 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:49,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:49,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:49,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:49,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:49,131 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-27 17:28:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:49,153 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-27 17:28:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:49,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:28:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:49,161 INFO L225 Difference]: With dead ends: 1326 [2019-12-27 17:28:49,161 INFO L226 Difference]: Without dead ends: 1326 [2019-12-27 17:28:49,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-27 17:28:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-27 17:28:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-27 17:28:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-27 17:28:49,194 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-27 17:28:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:49,195 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-27 17:28:49,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-27 17:28:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:28:49,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:49,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:49,196 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-27 17:28:49,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:49,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088777130] [2019-12-27 17:28:49,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:49,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088777130] [2019-12-27 17:28:49,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:49,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:49,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1091272427] [2019-12-27 17:28:49,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:49,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:49,329 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:28:49,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:49,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:28:49,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:49,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:49,387 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 5 states. [2019-12-27 17:28:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:49,741 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-27 17:28:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:28:49,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:28:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:49,751 INFO L225 Difference]: With dead ends: 1806 [2019-12-27 17:28:49,752 INFO L226 Difference]: Without dead ends: 1806 [2019-12-27 17:28:49,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-27 17:28:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-27 17:28:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 17:28:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-27 17:28:49,860 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-27 17:28:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:49,861 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-27 17:28:49,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-27 17:28:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 17:28:49,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:49,865 INFO L411 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] [2019-12-27 17:28:49,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:49,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:49,865 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-27 17:28:49,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:49,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780830949] [2019-12-27 17:28:49,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:49,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780830949] [2019-12-27 17:28:49,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:49,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:49,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1907123572] [2019-12-27 17:28:49,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:49,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:49,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 17:28:49,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:49,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:28:49,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:49,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:49,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:49,966 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 5 states. [2019-12-27 17:28:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:49,989 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-27 17:28:49,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:28:49,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 17:28:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:49,992 INFO L225 Difference]: With dead ends: 356 [2019-12-27 17:28:49,992 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 17:28:49,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 17:28:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-27 17:28:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 17:28:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-27 17:28:49,999 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-27 17:28:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:49,999 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-27 17:28:49,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-27 17:28:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:50,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:50,003 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:50,003 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:50,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-27 17:28:50,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:50,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895318985] [2019-12-27 17:28:50,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:50,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895318985] [2019-12-27 17:28:50,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:50,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:50,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44364291] [2019-12-27 17:28:50,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:50,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:50,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 17:28:50,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:50,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:50,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:50,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:50,190 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-27 17:28:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:50,236 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-27 17:28:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:50,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:28:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:50,239 INFO L225 Difference]: With dead ends: 331 [2019-12-27 17:28:50,239 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 17:28:50,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 17:28:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-27 17:28:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 17:28:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-27 17:28:50,247 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-27 17:28:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:50,248 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-27 17:28:50,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-27 17:28:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:50,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:50,252 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:50,252 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-27 17:28:50,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:50,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241139427] [2019-12-27 17:28:50,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:50,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241139427] [2019-12-27 17:28:50,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:50,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:28:50,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [913175434] [2019-12-27 17:28:50,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:50,414 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:50,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 17:28:50,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:50,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:28:50,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:50,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:50,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:50,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:50,460 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-27 17:28:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:50,732 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-27 17:28:50,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:28:50,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 17:28:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:50,736 INFO L225 Difference]: With dead ends: 458 [2019-12-27 17:28:50,736 INFO L226 Difference]: Without dead ends: 458 [2019-12-27 17:28:50,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-27 17:28:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-27 17:28:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-27 17:28:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-27 17:28:50,746 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-27 17:28:50,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:50,747 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-27 17:28:50,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-27 17:28:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:50,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:50,748 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:50,748 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-27 17:28:50,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:50,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439353504] [2019-12-27 17:28:50,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:50,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439353504] [2019-12-27 17:28:50,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:50,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:50,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991931974] [2019-12-27 17:28:50,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:50,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:50,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 90 transitions. [2019-12-27 17:28:50,894 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:50,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:50,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:28:50,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:28:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:50,895 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-27 17:28:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:51,272 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-27 17:28:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:28:51,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 17:28:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:51,275 INFO L225 Difference]: With dead ends: 513 [2019-12-27 17:28:51,276 INFO L226 Difference]: Without dead ends: 513 [2019-12-27 17:28:51,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:28:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-27 17:28:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-27 17:28:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 17:28:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-27 17:28:51,286 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-27 17:28:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:51,286 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-27 17:28:51,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:28:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-27 17:28:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:51,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:51,288 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:51,288 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-27 17:28:51,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:51,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822934731] [2019-12-27 17:28:51,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:51,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822934731] [2019-12-27 17:28:51,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:51,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:51,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1869963156] [2019-12-27 17:28:51,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:51,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:51,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 103 transitions. [2019-12-27 17:28:51,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:51,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:28:51,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:28:51,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:28:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:28:51,576 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 10 states. [2019-12-27 17:28:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:52,848 INFO L93 Difference]: Finished difference Result 1004 states and 1752 transitions. [2019-12-27 17:28:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:28:52,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 17:28:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:52,852 INFO L225 Difference]: With dead ends: 1004 [2019-12-27 17:28:52,852 INFO L226 Difference]: Without dead ends: 1004 [2019-12-27 17:28:52,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:28:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-27 17:28:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 445. [2019-12-27 17:28:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-27 17:28:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-27 17:28:52,866 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-27 17:28:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:52,867 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-27 17:28:52,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:28:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-27 17:28:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:52,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:52,868 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:52,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-27 17:28:52,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:52,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226284808] [2019-12-27 17:28:52,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:52,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226284808] [2019-12-27 17:28:52,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:52,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:52,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [193087641] [2019-12-27 17:28:52,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:52,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:52,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 102 transitions. [2019-12-27 17:28:52,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:52,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:28:52,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:52,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:52,987 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 5 states. [2019-12-27 17:28:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:53,106 INFO L93 Difference]: Finished difference Result 510 states and 916 transitions. [2019-12-27 17:28:53,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:28:53,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 17:28:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:53,109 INFO L225 Difference]: With dead ends: 510 [2019-12-27 17:28:53,109 INFO L226 Difference]: Without dead ends: 510 [2019-12-27 17:28:53,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:28:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-12-27 17:28:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 406. [2019-12-27 17:28:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 17:28:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-27 17:28:53,118 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-27 17:28:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:53,119 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-27 17:28:53,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-27 17:28:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:28:53,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:53,120 INFO L411 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, 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] [2019-12-27 17:28:53,120 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-27 17:28:53,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:53,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243355844] [2019-12-27 17:28:53,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:53,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243355844] [2019-12-27 17:28:53,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:53,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:28:53,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [228826616] [2019-12-27 17:28:53,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:53,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:53,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 109 transitions. [2019-12-27 17:28:53,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:53,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:28:53,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:28:53,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:28:53,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:53,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:28:53,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:28:53,559 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 11 states. [2019-12-27 17:28:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:54,136 INFO L93 Difference]: Finished difference Result 458 states and 803 transitions. [2019-12-27 17:28:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:28:54,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 17:28:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:54,140 INFO L225 Difference]: With dead ends: 458 [2019-12-27 17:28:54,140 INFO L226 Difference]: Without dead ends: 458 [2019-12-27 17:28:54,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:28:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-27 17:28:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2019-12-27 17:28:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 17:28:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 601 transitions. [2019-12-27 17:28:54,148 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 601 transitions. Word has length 53 [2019-12-27 17:28:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:54,148 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 601 transitions. [2019-12-27 17:28:54,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:28:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 601 transitions. [2019-12-27 17:28:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:28:54,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:54,149 INFO L411 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, 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] [2019-12-27 17:28:54,150 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1617311510, now seen corresponding path program 2 times [2019-12-27 17:28:54,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:54,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665094148] [2019-12-27 17:28:54,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:54,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665094148] [2019-12-27 17:28:54,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:54,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:28:54,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225616566] [2019-12-27 17:28:54,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:54,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:54,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 115 transitions. [2019-12-27 17:28:54,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:54,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:28:54,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:28:54,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:28:54,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:28:54,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:28:54,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:28:54,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:28:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:28:54,547 INFO L87 Difference]: Start difference. First operand 340 states and 601 transitions. Second operand 12 states. [2019-12-27 17:28:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:55,013 INFO L93 Difference]: Finished difference Result 490 states and 851 transitions. [2019-12-27 17:28:55,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 17:28:55,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-27 17:28:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:55,017 INFO L225 Difference]: With dead ends: 490 [2019-12-27 17:28:55,017 INFO L226 Difference]: Without dead ends: 490 [2019-12-27 17:28:55,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:28:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-27 17:28:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 328. [2019-12-27 17:28:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 17:28:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 580 transitions. [2019-12-27 17:28:55,026 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 580 transitions. Word has length 53 [2019-12-27 17:28:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:55,027 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 580 transitions. [2019-12-27 17:28:55,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:28:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 580 transitions. [2019-12-27 17:28:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:28:55,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:55,028 INFO L411 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, 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] [2019-12-27 17:28:55,028 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -162355984, now seen corresponding path program 3 times [2019-12-27 17:28:55,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:55,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998882809] [2019-12-27 17:28:55,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:55,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998882809] [2019-12-27 17:28:55,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:55,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:55,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146210223] [2019-12-27 17:28:55,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:55,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:55,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 108 transitions. [2019-12-27 17:28:55,318 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:55,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:28:55,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:28:55,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:28:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:28:55,344 INFO L87 Difference]: Start difference. First operand 328 states and 580 transitions. Second operand 8 states. [2019-12-27 17:28:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:55,466 INFO L93 Difference]: Finished difference Result 573 states and 1003 transitions. [2019-12-27 17:28:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:28:55,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 17:28:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:55,469 INFO L225 Difference]: With dead ends: 573 [2019-12-27 17:28:55,469 INFO L226 Difference]: Without dead ends: 262 [2019-12-27 17:28:55,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:28:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-27 17:28:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 238. [2019-12-27 17:28:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-12-27 17:28:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 404 transitions. [2019-12-27 17:28:55,475 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 404 transitions. Word has length 53 [2019-12-27 17:28:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:55,475 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 404 transitions. [2019-12-27 17:28:55,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:28:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 404 transitions. [2019-12-27 17:28:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:28:55,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:55,476 INFO L411 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, 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] [2019-12-27 17:28:55,476 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1236840700, now seen corresponding path program 4 times [2019-12-27 17:28:55,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:55,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026608259] [2019-12-27 17:28:55,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:55,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026608259] [2019-12-27 17:28:55,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:55,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:55,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873125464] [2019-12-27 17:28:55,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:55,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:55,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 102 transitions. [2019-12-27 17:28:55,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:55,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:55,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:55,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:55,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:55,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:55,590 INFO L87 Difference]: Start difference. First operand 238 states and 404 transitions. Second operand 3 states. [2019-12-27 17:28:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:55,637 INFO L93 Difference]: Finished difference Result 238 states and 403 transitions. [2019-12-27 17:28:55,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:55,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 17:28:55,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:55,639 INFO L225 Difference]: With dead ends: 238 [2019-12-27 17:28:55,639 INFO L226 Difference]: Without dead ends: 238 [2019-12-27 17:28:55,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-27 17:28:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 189. [2019-12-27 17:28:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-12-27 17:28:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2019-12-27 17:28:55,645 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 53 [2019-12-27 17:28:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:55,645 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2019-12-27 17:28:55,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2019-12-27 17:28:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:28:55,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:55,646 INFO L411 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, 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] [2019-12-27 17:28:55,646 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 1 times [2019-12-27 17:28:55,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:55,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179649642] [2019-12-27 17:28:55,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:55,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179649642] [2019-12-27 17:28:55,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:55,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:28:55,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666644506] [2019-12-27 17:28:55,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:55,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:55,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 75 transitions. [2019-12-27 17:28:55,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:55,898 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:28:55,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:28:55,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:28:55,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:28:55,899 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 14 states. [2019-12-27 17:28:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:56,578 INFO L93 Difference]: Finished difference Result 358 states and 600 transitions. [2019-12-27 17:28:56,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:28:56,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 17:28:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:56,580 INFO L225 Difference]: With dead ends: 358 [2019-12-27 17:28:56,580 INFO L226 Difference]: Without dead ends: 323 [2019-12-27 17:28:56,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:28:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-12-27 17:28:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 289. [2019-12-27 17:28:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-27 17:28:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 490 transitions. [2019-12-27 17:28:56,587 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 490 transitions. Word has length 54 [2019-12-27 17:28:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:56,587 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 490 transitions. [2019-12-27 17:28:56,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:28:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 490 transitions. [2019-12-27 17:28:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:28:56,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:56,589 INFO L411 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, 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] [2019-12-27 17:28:56,589 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 2 times [2019-12-27 17:28:56,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:56,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550379139] [2019-12-27 17:28:56,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:56,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550379139] [2019-12-27 17:28:56,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:56,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:28:56,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852969452] [2019-12-27 17:28:56,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:56,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:56,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 111 transitions. [2019-12-27 17:28:56,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:56,961 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:28:56,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:28:56,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:56,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:28:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:28:56,962 INFO L87 Difference]: Start difference. First operand 289 states and 490 transitions. Second operand 14 states. [2019-12-27 17:28:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:57,435 INFO L93 Difference]: Finished difference Result 394 states and 651 transitions. [2019-12-27 17:28:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:28:57,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 17:28:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:57,439 INFO L225 Difference]: With dead ends: 394 [2019-12-27 17:28:57,439 INFO L226 Difference]: Without dead ends: 359 [2019-12-27 17:28:57,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:28:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-12-27 17:28:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 297. [2019-12-27 17:28:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-27 17:28:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 504 transitions. [2019-12-27 17:28:57,447 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 504 transitions. Word has length 54 [2019-12-27 17:28:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:57,447 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 504 transitions. [2019-12-27 17:28:57,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:28:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 504 transitions. [2019-12-27 17:28:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:28:57,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:57,449 INFO L411 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, 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] [2019-12-27 17:28:57,449 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 3 times [2019-12-27 17:28:57,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:57,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139608066] [2019-12-27 17:28:57,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:28:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:28:57,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:28:57,544 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:28:57,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1447~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x~0_144) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22| 1) |v_#valid_47|) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_17|, ~x~0=v_~x~0_144, ULTIMATE.start_main_~#t1447~0.offset=|v_ULTIMATE.start_main_~#t1447~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ULTIMATE.start_main_~#t1447~0.base=|v_ULTIMATE.start_main_~#t1447~0.base_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1448~0.offset, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1448~0.base, ~x~0, ULTIMATE.start_main_~#t1447~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_~#t1447~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:28:57,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1448~0.base_10| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1448~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1448~0.offset_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10|) |v_ULTIMATE.start_main_~#t1448~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1448~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1448~0.base] because there is no mapped edge [2019-12-27 17:28:57,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 17:28:57,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-643406556| |P0Thread1of1ForFork0_#t~ite3_Out-643406556|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-643406556 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-643406556 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-643406556 |P0Thread1of1ForFork0_#t~ite3_Out-643406556|)) (and .cse0 (not .cse1) (= ~x$w_buff1~0_In-643406556 |P0Thread1of1ForFork0_#t~ite3_Out-643406556|) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-643406556, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-643406556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-643406556, ~x~0=~x~0_In-643406556} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-643406556|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-643406556|, ~x$w_buff1~0=~x$w_buff1~0_In-643406556, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-643406556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-643406556, ~x~0=~x~0_In-643406556} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:28:57,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In154989487 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In154989487 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out154989487| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out154989487| ~x$w_buff0_used~0_In154989487)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In154989487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In154989487} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out154989487|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In154989487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In154989487} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:28:57,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-395128481 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-395128481 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-395128481 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-395128481 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-395128481| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-395128481 |P0Thread1of1ForFork0_#t~ite6_Out-395128481|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-395128481, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-395128481, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-395128481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-395128481} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-395128481|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-395128481, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-395128481, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-395128481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-395128481} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:28:57,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In905376465 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In905376465 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out905376465|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In905376465 |P1Thread1of1ForFork1_#t~ite11_Out905376465|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In905376465, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905376465} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out905376465|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In905376465, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905376465} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:28:57,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In344552760 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In344552760 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In344552760 |P0Thread1of1ForFork0_#t~ite7_Out344552760|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out344552760|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In344552760, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344552760} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In344552760, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out344552760|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344552760} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:28:57,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1651274711 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1651274711 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1651274711 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1651274711 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1651274711| ~x$r_buff1_thd1~0_In-1651274711)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1651274711|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1651274711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1651274711, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1651274711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1651274711} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1651274711, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1651274711|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1651274711, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1651274711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1651274711} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:28:57,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 17:28:57,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-634188857 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-634188857 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-634188857 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-634188857 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-634188857|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-634188857 |P1Thread1of1ForFork1_#t~ite12_Out-634188857|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-634188857, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-634188857, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-634188857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-634188857} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-634188857, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-634188857, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-634188857|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-634188857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-634188857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:28:57,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-399324016 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-399324016 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-399324016 ~x$r_buff0_thd2~0_Out-399324016) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-399324016 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-399324016, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-399324016} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-399324016|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-399324016, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-399324016} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:28:57,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1120689433 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1120689433 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1120689433 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1120689433 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1120689433| ~x$r_buff1_thd2~0_In1120689433) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out1120689433| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1120689433, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1120689433, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1120689433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1120689433} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1120689433, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1120689433, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1120689433, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1120689433|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1120689433} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:28:57,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:28:57,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:28:57,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1078164587 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1078164587 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out1078164587| |ULTIMATE.start_main_#t~ite18_Out1078164587|))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1078164587| ~x~0_In1078164587) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite17_Out1078164587| ~x$w_buff1~0_In1078164587) (not .cse1) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1078164587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1078164587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1078164587, ~x~0=~x~0_In1078164587} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1078164587|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1078164587|, ~x$w_buff1~0=~x$w_buff1~0_In1078164587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1078164587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1078164587, ~x~0=~x~0_In1078164587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 17:28:57,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In570331963 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In570331963 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out570331963| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In570331963 |ULTIMATE.start_main_#t~ite19_Out570331963|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In570331963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570331963} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In570331963, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out570331963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570331963} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:28:57,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1278149754 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1278149754 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1278149754 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1278149754 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out1278149754| ~x$w_buff1_used~0_In1278149754)) (and (= |ULTIMATE.start_main_#t~ite20_Out1278149754| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1278149754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1278149754, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1278149754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278149754} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1278149754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1278149754, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1278149754|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1278149754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278149754} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:28:57,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2071974620 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2071974620 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-2071974620 |ULTIMATE.start_main_#t~ite21_Out-2071974620|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-2071974620|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2071974620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2071974620} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2071974620, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2071974620|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2071974620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:28:57,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-486840894 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-486840894 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-486840894 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-486840894 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-486840894 |ULTIMATE.start_main_#t~ite22_Out-486840894|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out-486840894| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486840894, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486840894, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-486840894, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486840894} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486840894, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486840894, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-486840894, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-486840894|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486840894} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:28:57,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In213198718 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_In213198718| |ULTIMATE.start_main_#t~ite31_Out213198718|) (= |ULTIMATE.start_main_#t~ite32_Out213198718| ~x$w_buff1~0_In213198718) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite31_Out213198718| ~x$w_buff1~0_In213198718) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In213198718 256)))) (or (and (= (mod ~x$r_buff1_thd0~0_In213198718 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In213198718 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In213198718 256) 0)))) (= |ULTIMATE.start_main_#t~ite32_Out213198718| |ULTIMATE.start_main_#t~ite31_Out213198718|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In213198718, ~x$w_buff1~0=~x$w_buff1~0_In213198718, ~x$w_buff1_used~0=~x$w_buff1_used~0_In213198718, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In213198718, ~weak$$choice2~0=~weak$$choice2~0_In213198718, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In213198718|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In213198718} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In213198718, ~x$w_buff1~0=~x$w_buff1~0_In213198718, ~x$w_buff1_used~0=~x$w_buff1_used~0_In213198718, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out213198718|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In213198718, ~weak$$choice2~0=~weak$$choice2~0_In213198718, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out213198718|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In213198718} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 17:28:57,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:28:57,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:28:57,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:28:57,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:28:57 BasicIcfg [2019-12-27 17:28:57,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:28:57,632 INFO L168 Benchmark]: Toolchain (without parser) took 16558.54 ms. Allocated memory was 144.7 MB in the beginning and 547.9 MB in the end (delta: 403.2 MB). Free memory was 101.2 MB in the beginning and 204.0 MB in the end (delta: -102.8 MB). Peak memory consumption was 300.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:57,633 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 17:28:57,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.34 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 156.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:57,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.21 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 153.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:57,638 INFO L168 Benchmark]: Boogie Preprocessor took 42.29 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:57,638 INFO L168 Benchmark]: RCFGBuilder took 796.46 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 107.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:57,639 INFO L168 Benchmark]: TraceAbstraction took 14891.92 ms. Allocated memory was 202.4 MB in the beginning and 547.9 MB in the end (delta: 345.5 MB). Free memory was 107.0 MB in the beginning and 204.0 MB in the end (delta: -97.0 MB). Peak memory consumption was 248.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:57,648 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.34 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 156.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.21 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 153.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.29 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.46 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 107.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14891.92 ms. Allocated memory was 202.4 MB in the beginning and 547.9 MB in the end (delta: 345.5 MB). Free memory was 107.0 MB in the beginning and 204.0 MB in the end (delta: -97.0 MB). Peak memory consumption was 248.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L781] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 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) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 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 [L756] 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) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 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 [L787] 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) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L787] 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) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L798] 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) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L798] 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) [L799] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L799] 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)) [L800] 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)) [L801] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L801] 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)) [L802] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] 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)) [L804] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L804] 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)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1495 SDtfs, 1866 SDslu, 4201 SDs, 0 SdLazy, 3101 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 48 SyntacticMatches, 34 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1494 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 119414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...