/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:34:11,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:34:11,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:34:11,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:34:11,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:34:11,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:34:11,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:34:11,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:34:11,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:34:11,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:34:11,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:34:11,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:34:11,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:34:11,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:34:11,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:34:11,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:34:11,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:34:11,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:34:11,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:34:11,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:34:11,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:34:11,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:34:11,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:34:11,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:34:11,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:34:11,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:34:11,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:34:11,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:34:11,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:34:11,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:34:11,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:34:11,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:34:11,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:34:11,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:34:11,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:34:11,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:34:11,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:34:11,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:34:11,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:34:11,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:34:11,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:34:11,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:34:11,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:34:11,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:34:11,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:34:11,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:34:11,840 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:34:11,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:34:11,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:34:11,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:34:11,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:34:11,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:34:11,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:34:11,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:34:11,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:34:11,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:34:11,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:34:11,842 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:34:11,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:34:11,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:34:11,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:34:11,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:34:11,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:34:11,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:34:11,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:34:11,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:34:11,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:34:11,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:34:11,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:34:11,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:34:11,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:34:11,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:34:12,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:34:12,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:34:12,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:34:12,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:34:12,125 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:34:12,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2019-12-26 23:34:12,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5555062c/2903638c7f7f4893af8b749304ca4a0b/FLAG2e70c4c3c [2019-12-26 23:34:12,743 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:34:12,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2019-12-26 23:34:12,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5555062c/2903638c7f7f4893af8b749304ca4a0b/FLAG2e70c4c3c [2019-12-26 23:34:13,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5555062c/2903638c7f7f4893af8b749304ca4a0b [2019-12-26 23:34:13,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:34:13,080 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:34:13,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:34:13,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:34:13,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:34:13,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e8aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13, skipping insertion in model container [2019-12-26 23:34:13,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:34:13,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:34:13,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:34:13,673 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:34:13,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:34:13,827 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:34:13,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13 WrapperNode [2019-12-26 23:34:13,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:34:13,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:34:13,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:34:13,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:34:13,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:34:13,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:34:13,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:34:13,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:34:13,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (1/1) ... [2019-12-26 23:34:13,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:34:13,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:34:13,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:34:13,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:34:13,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (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-26 23:34:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:34:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:34:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:34:14,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:34:14,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:34:14,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:34:14,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:34:14,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:34:14,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:34:14,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:34:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:34:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:34:14,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:34:14,019 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:34:14,985 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:34:14,985 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:34:14,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:34:14 BoogieIcfgContainer [2019-12-26 23:34:14,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:34:14,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:34:14,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:34:14,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:34:14,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:34:13" (1/3) ... [2019-12-26 23:34:14,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1972b4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:34:14, skipping insertion in model container [2019-12-26 23:34:14,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:34:13" (2/3) ... [2019-12-26 23:34:14,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1972b4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:34:14, skipping insertion in model container [2019-12-26 23:34:14,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:34:14" (3/3) ... [2019-12-26 23:34:14,996 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2019-12-26 23:34:15,007 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:34:15,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:34:15,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:34:15,022 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:34:15,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,096 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,096 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,134 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,135 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:34:15,152 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:34:15,173 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:34:15,173 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:34:15,173 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:34:15,173 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:34:15,174 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:34:15,174 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:34:15,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:34:15,174 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:34:15,191 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:34:15,193 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:34:15,292 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:34:15,293 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:34:15,311 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:34:15,338 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:34:15,393 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:34:15,394 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:34:15,404 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:34:15,431 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 23:34:15,433 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:34:18,579 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-26 23:34:20,603 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:34:20,740 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:34:20,768 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-26 23:34:20,768 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 23:34:20,772 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-26 23:34:35,901 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-26 23:34:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-26 23:34:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:34:35,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:35,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:34:35,912 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-26 23:34:35,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:35,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554150980] [2019-12-26 23:34:35,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:36,155 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-26 23:34:36,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554150980] [2019-12-26 23:34:36,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:36,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:34:36,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890479466] [2019-12-26 23:34:36,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:34:36,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:34:36,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:34:36,182 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-26 23:34:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:38,922 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-26 23:34:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:34:38,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:34:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:39,607 INFO L225 Difference]: With dead ends: 107108 [2019-12-26 23:34:39,607 INFO L226 Difference]: Without dead ends: 104924 [2019-12-26 23:34:39,609 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-26 23:34:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-26 23:34:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-26 23:34:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-26 23:34:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-26 23:34:50,261 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-26 23:34:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:50,262 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-26 23:34:50,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:34:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-26 23:34:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:34:50,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:50,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:50,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-26 23:34:50,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:50,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513972038] [2019-12-26 23:34:50,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:50,388 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-26 23:34:50,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513972038] [2019-12-26 23:34:50,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:50,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:34:50,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768370453] [2019-12-26 23:34:50,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:34:50,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:34:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:34:50,393 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-26 23:34:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:55,794 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-26 23:34:55,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:34:55,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:34:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:56,452 INFO L225 Difference]: With dead ends: 168606 [2019-12-26 23:34:56,453 INFO L226 Difference]: Without dead ends: 168557 [2019-12-26 23:34:56,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:35:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-26 23:35:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-26 23:35:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-26 23:35:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-26 23:35:10,473 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-26 23:35:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:10,474 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-26 23:35:10,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:35:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-26 23:35:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:35:10,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:10,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:10,482 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-26 23:35:10,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:10,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918178243] [2019-12-26 23:35:10,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:10,592 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-26 23:35:10,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918178243] [2019-12-26 23:35:10,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:10,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:35:10,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405663126] [2019-12-26 23:35:10,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:35:10,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:35:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:35:10,596 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-26 23:35:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:13,418 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-26 23:35:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:35:13,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:35:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:14,079 INFO L225 Difference]: With dead ends: 217678 [2019-12-26 23:35:14,079 INFO L226 Difference]: Without dead ends: 217615 [2019-12-26 23:35:14,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:35:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-26 23:35:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-26 23:35:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-26 23:35:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-26 23:35:30,787 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-26 23:35:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:30,788 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-26 23:35:30,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:35:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-26 23:35:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:35:30,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:30,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:30,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-26 23:35:30,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:30,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123809467] [2019-12-26 23:35:30,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:30,835 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-26 23:35:30,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123809467] [2019-12-26 23:35:30,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:30,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:35:30,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369081256] [2019-12-26 23:35:30,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:35:30,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:30,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:35:30,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:35:30,841 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-26 23:35:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:30,973 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-26 23:35:30,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:35:30,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:35:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:31,053 INFO L225 Difference]: With dead ends: 36985 [2019-12-26 23:35:31,054 INFO L226 Difference]: Without dead ends: 36985 [2019-12-26 23:35:31,054 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-26 23:35:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-26 23:35:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-26 23:35:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-26 23:35:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-26 23:35:31,742 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-26 23:35:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:31,742 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-26 23:35:31,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:35:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-26 23:35:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:35:31,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:31,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:31,750 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-26 23:35:31,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:31,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146746469] [2019-12-26 23:35:31,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:31,889 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-26 23:35:31,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146746469] [2019-12-26 23:35:31,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:31,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:35:31,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55242328] [2019-12-26 23:35:31,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:35:31,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:31,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:35:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:35:31,891 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 6 states. [2019-12-26 23:35:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:35,137 INFO L93 Difference]: Finished difference Result 51224 states and 162226 transitions. [2019-12-26 23:35:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:35:35,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-26 23:35:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:35,218 INFO L225 Difference]: With dead ends: 51224 [2019-12-26 23:35:35,218 INFO L226 Difference]: Without dead ends: 51217 [2019-12-26 23:35:35,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:35:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51217 states. [2019-12-26 23:35:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51217 to 37313. [2019-12-26 23:35:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37313 states. [2019-12-26 23:35:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37313 states to 37313 states and 121596 transitions. [2019-12-26 23:35:35,916 INFO L78 Accepts]: Start accepts. Automaton has 37313 states and 121596 transitions. Word has length 19 [2019-12-26 23:35:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:35,917 INFO L462 AbstractCegarLoop]: Abstraction has 37313 states and 121596 transitions. [2019-12-26 23:35:35,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:35:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 37313 states and 121596 transitions. [2019-12-26 23:35:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:35:35,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:35,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:35,922 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash -159037504, now seen corresponding path program 2 times [2019-12-26 23:35:35,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:35,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142692191] [2019-12-26 23:35:35,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:35,990 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-26 23:35:35,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142692191] [2019-12-26 23:35:35,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:35,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:35:35,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444375435] [2019-12-26 23:35:35,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:35:35,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:35:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:35:35,992 INFO L87 Difference]: Start difference. First operand 37313 states and 121596 transitions. Second operand 5 states. [2019-12-26 23:35:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:36,742 INFO L93 Difference]: Finished difference Result 47151 states and 150759 transitions. [2019-12-26 23:35:36,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:35:36,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:35:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:36,851 INFO L225 Difference]: With dead ends: 47151 [2019-12-26 23:35:36,851 INFO L226 Difference]: Without dead ends: 47144 [2019-12-26 23:35:36,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:35:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47144 states. [2019-12-26 23:35:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47144 to 37328. [2019-12-26 23:35:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-26 23:35:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-26 23:35:38,078 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-26 23:35:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:38,078 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-26 23:35:38,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:35:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-26 23:35:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:35:38,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:38,087 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] [2019-12-26 23:35:38,087 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-26 23:35:38,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:38,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404908200] [2019-12-26 23:35:38,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:38,141 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-26 23:35:38,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404908200] [2019-12-26 23:35:38,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:38,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:35:38,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008276622] [2019-12-26 23:35:38,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:35:38,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:35:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:35:38,143 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-26 23:35:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:38,173 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-26 23:35:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:35:38,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:35:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:38,182 INFO L225 Difference]: With dead ends: 7104 [2019-12-26 23:35:38,182 INFO L226 Difference]: Without dead ends: 7104 [2019-12-26 23:35:38,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:35:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-26 23:35:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-26 23:35:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-26 23:35:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-26 23:35:38,270 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-26 23:35:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:38,270 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-26 23:35:38,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:35:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-26 23:35:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:35:38,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:38,281 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] [2019-12-26 23:35:38,281 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:38,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-26 23:35:38,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:38,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339766723] [2019-12-26 23:35:38,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:38,391 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-26 23:35:38,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339766723] [2019-12-26 23:35:38,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:38,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:35:38,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144243150] [2019-12-26 23:35:38,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:35:38,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:35:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:35:38,393 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-26 23:35:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:38,434 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-26 23:35:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:35:38,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:35:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:38,445 INFO L225 Difference]: With dead ends: 5024 [2019-12-26 23:35:38,445 INFO L226 Difference]: Without dead ends: 5024 [2019-12-26 23:35:38,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 23:35:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-26 23:35:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-26 23:35:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-26 23:35:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-26 23:35:38,560 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-26 23:35:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:38,563 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-26 23:35:38,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:35:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-26 23:35:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:35:38,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:38,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:38,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-26 23:35:38,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:38,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007939650] [2019-12-26 23:35:38,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:38,680 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-26 23:35:38,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007939650] [2019-12-26 23:35:38,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:38,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:35:38,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700193079] [2019-12-26 23:35:38,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:35:38,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:35:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:35:38,683 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-26 23:35:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:38,739 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-26 23:35:38,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:35:38,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:35:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:38,748 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:35:38,748 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:35:38,748 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-26 23:35:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:35:38,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:35:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:35:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-26 23:35:38,839 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-26 23:35:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:38,840 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-26 23:35:38,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:35:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-26 23:35:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:35:38,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:38,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:38,854 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:38,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-26 23:35:38,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:38,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666523503] [2019-12-26 23:35:38,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:38,932 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-26 23:35:38,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666523503] [2019-12-26 23:35:38,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:38,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:35:38,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709867968] [2019-12-26 23:35:38,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:35:38,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:35:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:35:38,934 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-26 23:35:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:38,987 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-26 23:35:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:35:38,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:35:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:38,995 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:35:38,995 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:35:38,995 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-26 23:35:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:35:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:35:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:35:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-26 23:35:39,115 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-26 23:35:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:39,115 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-26 23:35:39,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:35:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-26 23:35:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:35:39,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:39,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:39,129 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-26 23:35:39,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:39,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172489293] [2019-12-26 23:35:39,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:39,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-26 23:35:39,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172489293] [2019-12-26 23:35:39,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:39,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:35:39,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613767923] [2019-12-26 23:35:39,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:35:39,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:35:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:35:39,327 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-26 23:35:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:39,820 INFO L93 Difference]: Finished difference Result 8765 states and 25085 transitions. [2019-12-26 23:35:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:35:39,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:35:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:39,831 INFO L225 Difference]: With dead ends: 8765 [2019-12-26 23:35:39,832 INFO L226 Difference]: Without dead ends: 8765 [2019-12-26 23:35:39,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:35:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2019-12-26 23:35:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 5421. [2019-12-26 23:35:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-26 23:35:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-26 23:35:40,033 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-26 23:35:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:40,033 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-26 23:35:40,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:35:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-26 23:35:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:35:40,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:40,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:40,041 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash -191494421, now seen corresponding path program 2 times [2019-12-26 23:35:40,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:40,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315677210] [2019-12-26 23:35:40,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:40,130 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-26 23:35:40,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315677210] [2019-12-26 23:35:40,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:40,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:35:40,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892832025] [2019-12-26 23:35:40,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:35:40,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:35:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:35:40,132 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 5 states. [2019-12-26 23:35:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:40,459 INFO L93 Difference]: Finished difference Result 7981 states and 22730 transitions. [2019-12-26 23:35:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:35:40,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:35:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:40,475 INFO L225 Difference]: With dead ends: 7981 [2019-12-26 23:35:40,475 INFO L226 Difference]: Without dead ends: 7981 [2019-12-26 23:35:40,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:35:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7981 states. [2019-12-26 23:35:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7981 to 5923. [2019-12-26 23:35:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-26 23:35:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-26 23:35:40,642 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-26 23:35:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:40,642 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-26 23:35:40,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:35:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-26 23:35:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:35:40,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:40,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:40,654 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 147719209, now seen corresponding path program 3 times [2019-12-26 23:35:40,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:40,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98762150] [2019-12-26 23:35:40,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:40,755 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-26 23:35:40,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98762150] [2019-12-26 23:35:40,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:40,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:35:40,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764846521] [2019-12-26 23:35:40,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:35:40,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:35:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:35:40,757 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-26 23:35:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:40,787 INFO L93 Difference]: Finished difference Result 5119 states and 14578 transitions. [2019-12-26 23:35:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:35:40,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:35:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:40,795 INFO L225 Difference]: With dead ends: 5119 [2019-12-26 23:35:40,795 INFO L226 Difference]: Without dead ends: 5119 [2019-12-26 23:35:40,795 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-26 23:35:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-26 23:35:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4839. [2019-12-26 23:35:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-12-26 23:35:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13806 transitions. [2019-12-26 23:35:40,887 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13806 transitions. Word has length 65 [2019-12-26 23:35:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:40,887 INFO L462 AbstractCegarLoop]: Abstraction has 4839 states and 13806 transitions. [2019-12-26 23:35:40,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:35:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13806 transitions. [2019-12-26 23:35:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:35:40,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:40,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:40,898 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2002555555, now seen corresponding path program 1 times [2019-12-26 23:35:40,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:40,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021617130] [2019-12-26 23:35:40,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:41,006 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-26 23:35:41,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021617130] [2019-12-26 23:35:41,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:41,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:35:41,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431023399] [2019-12-26 23:35:41,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:35:41,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:35:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:35:41,008 INFO L87 Difference]: Start difference. First operand 4839 states and 13806 transitions. Second operand 6 states. [2019-12-26 23:35:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:41,411 INFO L93 Difference]: Finished difference Result 7011 states and 19683 transitions. [2019-12-26 23:35:41,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:35:41,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:35:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:41,423 INFO L225 Difference]: With dead ends: 7011 [2019-12-26 23:35:41,423 INFO L226 Difference]: Without dead ends: 7011 [2019-12-26 23:35:41,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:35:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7011 states. [2019-12-26 23:35:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7011 to 5532. [2019-12-26 23:35:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2019-12-26 23:35:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 15751 transitions. [2019-12-26 23:35:41,505 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 15751 transitions. Word has length 66 [2019-12-26 23:35:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:41,505 INFO L462 AbstractCegarLoop]: Abstraction has 5532 states and 15751 transitions. [2019-12-26 23:35:41,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:35:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 15751 transitions. [2019-12-26 23:35:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:35:41,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:41,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:41,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2081518173, now seen corresponding path program 2 times [2019-12-26 23:35:41,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:41,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748099665] [2019-12-26 23:35:41,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:41,608 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-26 23:35:41,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748099665] [2019-12-26 23:35:41,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:41,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:35:41,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328850928] [2019-12-26 23:35:41,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:35:41,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:41,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:35:41,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:35:41,610 INFO L87 Difference]: Start difference. First operand 5532 states and 15751 transitions. Second operand 6 states. [2019-12-26 23:35:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:42,082 INFO L93 Difference]: Finished difference Result 7597 states and 21220 transitions. [2019-12-26 23:35:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:35:42,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:35:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:42,092 INFO L225 Difference]: With dead ends: 7597 [2019-12-26 23:35:42,092 INFO L226 Difference]: Without dead ends: 7597 [2019-12-26 23:35:42,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:35:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2019-12-26 23:35:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 5931. [2019-12-26 23:35:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-26 23:35:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 16730 transitions. [2019-12-26 23:35:42,194 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 16730 transitions. Word has length 66 [2019-12-26 23:35:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:42,194 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 16730 transitions. [2019-12-26 23:35:42,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:35:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 16730 transitions. [2019-12-26 23:35:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:35:42,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:42,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:42,203 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1769494633, now seen corresponding path program 3 times [2019-12-26 23:35:42,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:42,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418076785] [2019-12-26 23:35:42,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:42,314 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-26 23:35:42,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418076785] [2019-12-26 23:35:42,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:42,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:35:42,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370660584] [2019-12-26 23:35:42,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:35:42,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:35:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:35:42,316 INFO L87 Difference]: Start difference. First operand 5931 states and 16730 transitions. Second operand 7 states. [2019-12-26 23:35:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:43,017 INFO L93 Difference]: Finished difference Result 8661 states and 24091 transitions. [2019-12-26 23:35:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:35:43,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 23:35:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:43,028 INFO L225 Difference]: With dead ends: 8661 [2019-12-26 23:35:43,029 INFO L226 Difference]: Without dead ends: 8661 [2019-12-26 23:35:43,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:35:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8661 states. [2019-12-26 23:35:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8661 to 5847. [2019-12-26 23:35:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5847 states. [2019-12-26 23:35:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5847 states to 5847 states and 16504 transitions. [2019-12-26 23:35:43,124 INFO L78 Accepts]: Start accepts. Automaton has 5847 states and 16504 transitions. Word has length 66 [2019-12-26 23:35:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:43,124 INFO L462 AbstractCegarLoop]: Abstraction has 5847 states and 16504 transitions. [2019-12-26 23:35:43,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:35:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5847 states and 16504 transitions. [2019-12-26 23:35:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:35:43,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:43,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:43,135 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash -248419697, now seen corresponding path program 4 times [2019-12-26 23:35:43,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:43,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958554106] [2019-12-26 23:35:43,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:43,219 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-26 23:35:43,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958554106] [2019-12-26 23:35:43,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:43,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:35:43,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882110414] [2019-12-26 23:35:43,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:35:43,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:43,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:35:43,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:35:43,221 INFO L87 Difference]: Start difference. First operand 5847 states and 16504 transitions. Second operand 5 states. [2019-12-26 23:35:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:43,414 INFO L93 Difference]: Finished difference Result 7638 states and 21269 transitions. [2019-12-26 23:35:43,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:35:43,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:35:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:43,424 INFO L225 Difference]: With dead ends: 7638 [2019-12-26 23:35:43,425 INFO L226 Difference]: Without dead ends: 7638 [2019-12-26 23:35:43,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:35:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2019-12-26 23:35:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 6001. [2019-12-26 23:35:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6001 states. [2019-12-26 23:35:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 16930 transitions. [2019-12-26 23:35:43,512 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 16930 transitions. Word has length 66 [2019-12-26 23:35:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:43,512 INFO L462 AbstractCegarLoop]: Abstraction has 6001 states and 16930 transitions. [2019-12-26 23:35:43,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:35:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 16930 transitions. [2019-12-26 23:35:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:35:43,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:43,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:43,519 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -140875571, now seen corresponding path program 5 times [2019-12-26 23:35:43,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:43,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854386124] [2019-12-26 23:35:43,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:43,700 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-26 23:35:43,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854386124] [2019-12-26 23:35:43,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:43,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:35:43,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36341045] [2019-12-26 23:35:43,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:35:43,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:35:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:35:43,702 INFO L87 Difference]: Start difference. First operand 6001 states and 16930 transitions. Second operand 7 states. [2019-12-26 23:35:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:43,937 INFO L93 Difference]: Finished difference Result 20213 states and 57320 transitions. [2019-12-26 23:35:43,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:35:43,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 23:35:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:43,956 INFO L225 Difference]: With dead ends: 20213 [2019-12-26 23:35:43,956 INFO L226 Difference]: Without dead ends: 12067 [2019-12-26 23:35:43,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:35:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12067 states. [2019-12-26 23:35:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12067 to 6001. [2019-12-26 23:35:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6001 states. [2019-12-26 23:35:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 16851 transitions. [2019-12-26 23:35:44,129 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 16851 transitions. Word has length 66 [2019-12-26 23:35:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:44,130 INFO L462 AbstractCegarLoop]: Abstraction has 6001 states and 16851 transitions. [2019-12-26 23:35:44,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:35:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 16851 transitions. [2019-12-26 23:35:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:35:44,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:44,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:44,141 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:44,141 INFO L82 PathProgramCache]: Analyzing trace with hash -667235773, now seen corresponding path program 6 times [2019-12-26 23:35:44,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:44,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119633144] [2019-12-26 23:35:44,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:44,211 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-26 23:35:44,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119633144] [2019-12-26 23:35:44,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:44,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:35:44,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929125221] [2019-12-26 23:35:44,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:35:44,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:35:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:35:44,214 INFO L87 Difference]: Start difference. First operand 6001 states and 16851 transitions. Second operand 3 states. [2019-12-26 23:35:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:44,249 INFO L93 Difference]: Finished difference Result 5603 states and 15528 transitions. [2019-12-26 23:35:44,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:35:44,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:35:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:44,259 INFO L225 Difference]: With dead ends: 5603 [2019-12-26 23:35:44,259 INFO L226 Difference]: Without dead ends: 5603 [2019-12-26 23:35:44,260 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-26 23:35:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2019-12-26 23:35:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 5519. [2019-12-26 23:35:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2019-12-26 23:35:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 15302 transitions. [2019-12-26 23:35:44,395 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 15302 transitions. Word has length 66 [2019-12-26 23:35:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:44,395 INFO L462 AbstractCegarLoop]: Abstraction has 5519 states and 15302 transitions. [2019-12-26 23:35:44,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:35:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 15302 transitions. [2019-12-26 23:35:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:35:44,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:44,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:44,406 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1603018859, now seen corresponding path program 1 times [2019-12-26 23:35:44,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:44,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237119600] [2019-12-26 23:35:44,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:44,579 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-26 23:35:44,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237119600] [2019-12-26 23:35:44,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:44,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:35:44,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496979285] [2019-12-26 23:35:44,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:35:44,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:44,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:35:44,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:35:44,581 INFO L87 Difference]: Start difference. First operand 5519 states and 15302 transitions. Second operand 9 states. [2019-12-26 23:35:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:45,503 INFO L93 Difference]: Finished difference Result 10162 states and 27889 transitions. [2019-12-26 23:35:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:35:45,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 23:35:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:45,517 INFO L225 Difference]: With dead ends: 10162 [2019-12-26 23:35:45,517 INFO L226 Difference]: Without dead ends: 10162 [2019-12-26 23:35:45,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:35:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10162 states. [2019-12-26 23:35:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10162 to 5960. [2019-12-26 23:35:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5960 states. [2019-12-26 23:35:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5960 states to 5960 states and 16592 transitions. [2019-12-26 23:35:45,631 INFO L78 Accepts]: Start accepts. Automaton has 5960 states and 16592 transitions. Word has length 67 [2019-12-26 23:35:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:45,632 INFO L462 AbstractCegarLoop]: Abstraction has 5960 states and 16592 transitions. [2019-12-26 23:35:45,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:35:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5960 states and 16592 transitions. [2019-12-26 23:35:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:35:45,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:45,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:45,638 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:45,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:45,638 INFO L82 PathProgramCache]: Analyzing trace with hash 173931463, now seen corresponding path program 2 times [2019-12-26 23:35:45,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:45,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866348243] [2019-12-26 23:35:45,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:45,760 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-26 23:35:45,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866348243] [2019-12-26 23:35:45,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:45,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:35:45,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362392679] [2019-12-26 23:35:45,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:35:45,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:35:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:35:45,762 INFO L87 Difference]: Start difference. First operand 5960 states and 16592 transitions. Second operand 6 states. [2019-12-26 23:35:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:45,865 INFO L93 Difference]: Finished difference Result 10095 states and 28098 transitions. [2019-12-26 23:35:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:35:45,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-26 23:35:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:45,872 INFO L225 Difference]: With dead ends: 10095 [2019-12-26 23:35:45,872 INFO L226 Difference]: Without dead ends: 4396 [2019-12-26 23:35:45,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:35:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-12-26 23:35:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 3649. [2019-12-26 23:35:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2019-12-26 23:35:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 10041 transitions. [2019-12-26 23:35:45,934 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 10041 transitions. Word has length 67 [2019-12-26 23:35:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:45,934 INFO L462 AbstractCegarLoop]: Abstraction has 3649 states and 10041 transitions. [2019-12-26 23:35:45,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:35:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 10041 transitions. [2019-12-26 23:35:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:35:45,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:45,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:45,939 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:45,940 INFO L82 PathProgramCache]: Analyzing trace with hash -378425991, now seen corresponding path program 3 times [2019-12-26 23:35:45,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:45,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324591015] [2019-12-26 23:35:45,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:46,035 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-26 23:35:46,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324591015] [2019-12-26 23:35:46,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:46,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:35:46,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496766268] [2019-12-26 23:35:46,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:35:46,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:35:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:35:46,037 INFO L87 Difference]: Start difference. First operand 3649 states and 10041 transitions. Second operand 6 states. [2019-12-26 23:35:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:46,105 INFO L93 Difference]: Finished difference Result 6411 states and 17591 transitions. [2019-12-26 23:35:46,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:35:46,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-26 23:35:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:46,110 INFO L225 Difference]: With dead ends: 6411 [2019-12-26 23:35:46,110 INFO L226 Difference]: Without dead ends: 2803 [2019-12-26 23:35:46,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:35:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2019-12-26 23:35:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2803. [2019-12-26 23:35:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2019-12-26 23:35:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 7622 transitions. [2019-12-26 23:35:46,147 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 7622 transitions. Word has length 67 [2019-12-26 23:35:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:46,147 INFO L462 AbstractCegarLoop]: Abstraction has 2803 states and 7622 transitions. [2019-12-26 23:35:46,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:35:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 7622 transitions. [2019-12-26 23:35:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:35:46,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:46,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:46,150 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 905212147, now seen corresponding path program 4 times [2019-12-26 23:35:46,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:46,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626505607] [2019-12-26 23:35:46,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:46,458 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-26 23:35:46,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626505607] [2019-12-26 23:35:46,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:46,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:35:46,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644855494] [2019-12-26 23:35:46,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:35:46,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:46,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:35:46,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:35:46,467 INFO L87 Difference]: Start difference. First operand 2803 states and 7622 transitions. Second operand 11 states. [2019-12-26 23:35:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:47,926 INFO L93 Difference]: Finished difference Result 6110 states and 16313 transitions. [2019-12-26 23:35:47,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:35:47,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 23:35:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:47,933 INFO L225 Difference]: With dead ends: 6110 [2019-12-26 23:35:47,934 INFO L226 Difference]: Without dead ends: 6110 [2019-12-26 23:35:47,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 23:35:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-12-26 23:35:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 2789. [2019-12-26 23:35:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-12-26 23:35:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 7624 transitions. [2019-12-26 23:35:47,986 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 7624 transitions. Word has length 67 [2019-12-26 23:35:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:47,986 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 7624 transitions. [2019-12-26 23:35:47,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:35:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 7624 transitions. [2019-12-26 23:35:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:35:47,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:47,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:47,989 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:47,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:47,989 INFO L82 PathProgramCache]: Analyzing trace with hash -902061977, now seen corresponding path program 5 times [2019-12-26 23:35:47,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:47,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872419192] [2019-12-26 23:35:47,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:48,052 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-26 23:35:48,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872419192] [2019-12-26 23:35:48,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:48,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:35:48,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769057309] [2019-12-26 23:35:48,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:35:48,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:35:48,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:35:48,054 INFO L87 Difference]: Start difference. First operand 2789 states and 7624 transitions. Second operand 3 states. [2019-12-26 23:35:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:48,105 INFO L93 Difference]: Finished difference Result 2789 states and 7623 transitions. [2019-12-26 23:35:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:35:48,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:35:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:48,109 INFO L225 Difference]: With dead ends: 2789 [2019-12-26 23:35:48,109 INFO L226 Difference]: Without dead ends: 2789 [2019-12-26 23:35:48,110 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-26 23:35:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2019-12-26 23:35:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1785. [2019-12-26 23:35:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-12-26 23:35:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 4875 transitions. [2019-12-26 23:35:48,154 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 4875 transitions. Word has length 67 [2019-12-26 23:35:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:48,154 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 4875 transitions. [2019-12-26 23:35:48,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:35:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 4875 transitions. [2019-12-26 23:35:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:35:48,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:48,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:48,157 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 1 times [2019-12-26 23:35:48,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:48,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406703658] [2019-12-26 23:35:48,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:35:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:35:48,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:35:48,280 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:35:48,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1888~0.base_20|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1888~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1888~0.base_20|) |v_ULTIMATE.start_main_~#t1888~0.offset_17| 0))) (= 0 v_~x$w_buff0~0_268) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1888~0.base_20| 4)) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 |v_ULTIMATE.start_main_~#t1888~0.offset_17|) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1888~0.base_20| 1)) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= v_~y~0_136 0) (= 0 v_~x$w_buff0_used~0_807) (= (select .cse0 |v_ULTIMATE.start_main_~#t1888~0.base_20|) 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t1890~0.offset=|v_ULTIMATE.start_main_~#t1890~0.offset_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_~#t1888~0.base=|v_ULTIMATE.start_main_~#t1888~0.base_20|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1888~0.offset=|v_ULTIMATE.start_main_~#t1888~0.offset_17|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1890~0.base=|v_ULTIMATE.start_main_~#t1890~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1889~0.offset=|v_ULTIMATE.start_main_~#t1889~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ULTIMATE.start_main_~#t1889~0.base=|v_ULTIMATE.start_main_~#t1889~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1890~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~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~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1888~0.base, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1888~0.offset, ~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_~#t1890~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1889~0.offset, ~weak$$choice2~0, ULTIMATE.start_main_~#t1889~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:35:48,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1889~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1889~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1889~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1889~0.base_11|) |v_ULTIMATE.start_main_~#t1889~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1889~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1889~0.base_11| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1889~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1889~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1889~0.offset=|v_ULTIMATE.start_main_~#t1889~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1889~0.base=|v_ULTIMATE.start_main_~#t1889~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1889~0.offset, #length, ULTIMATE.start_main_~#t1889~0.base] because there is no mapped edge [2019-12-26 23:35:48,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1890~0.base_9|) 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1890~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1890~0.base_9|) |v_ULTIMATE.start_main_~#t1890~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1890~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1890~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1890~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1890~0.base_9|) (= 0 |v_ULTIMATE.start_main_~#t1890~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1890~0.base=|v_ULTIMATE.start_main_~#t1890~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1890~0.offset=|v_ULTIMATE.start_main_~#t1890~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1890~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1890~0.offset] because there is no mapped edge [2019-12-26 23:35:48,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} 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-26 23:35:48,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-182904288 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-182904288 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-182904288| ~x$w_buff1~0_In-182904288) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-182904288| ~x~0_In-182904288)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-182904288, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-182904288, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-182904288, ~x~0=~x~0_In-182904288} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-182904288|, ~x$w_buff1~0=~x$w_buff1~0_In-182904288, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-182904288, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-182904288, ~x~0=~x~0_In-182904288} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:35:48,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 23:35:48,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1624302913 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1624302913 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1624302913|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1624302913 |P2Thread1of1ForFork2_#t~ite17_Out-1624302913|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1624302913, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1624302913} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1624302913, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1624302913|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1624302913} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:35:48,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In745938849 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In745938849 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In745938849 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In745938849 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out745938849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite18_Out745938849| ~x$w_buff1_used~0_In745938849) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In745938849, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In745938849, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745938849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745938849} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In745938849, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In745938849, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745938849, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out745938849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745938849} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:35:48,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1469231385| |P0Thread1of1ForFork0_#t~ite4_Out1469231385|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1469231385 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1469231385 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1469231385| ~x$w_buff1~0_In1469231385) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~x~0_In1469231385 |P0Thread1of1ForFork0_#t~ite3_Out1469231385|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1469231385, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1469231385, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1469231385, ~x~0=~x~0_In1469231385} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1469231385|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1469231385|, ~x$w_buff1~0=~x$w_buff1~0_In1469231385, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1469231385, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1469231385, ~x~0=~x~0_In1469231385} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:35:48,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In800650985 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In800650985 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out800650985| ~x$w_buff0_used~0_In800650985) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out800650985| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In800650985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In800650985} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out800650985|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In800650985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In800650985} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:35:48,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In410007396 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In410007396 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In410007396 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In410007396 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out410007396| ~x$w_buff1_used~0_In410007396) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out410007396| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In410007396, ~x$w_buff1_used~0=~x$w_buff1_used~0_In410007396, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In410007396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410007396} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out410007396|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In410007396, ~x$w_buff1_used~0=~x$w_buff1_used~0_In410007396, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In410007396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410007396} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:35:48,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1802267984 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1802267984 256)))) (or (and (= ~x$r_buff0_thd3~0_In-1802267984 |P2Thread1of1ForFork2_#t~ite19_Out-1802267984|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-1802267984| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1802267984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1802267984} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1802267984, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1802267984|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1802267984} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:35:48,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1823639501 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1823639501 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1823639501 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1823639501 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out1823639501| ~x$r_buff1_thd3~0_In1823639501) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite20_Out1823639501| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1823639501, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1823639501, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1823639501, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1823639501} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1823639501|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1823639501, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1823639501, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1823639501, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1823639501} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:35:48,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:35:48,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In525844718 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In525844718 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out525844718| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In525844718 |P0Thread1of1ForFork0_#t~ite7_Out525844718|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In525844718, ~x$w_buff0_used~0=~x$w_buff0_used~0_In525844718} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In525844718, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out525844718|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In525844718} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:35:48,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1867901941 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1867901941 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1867901941 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1867901941 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1867901941| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1867901941| ~x$r_buff1_thd1~0_In-1867901941) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1867901941, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1867901941, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1867901941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1867901941} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1867901941, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1867901941|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1867901941, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1867901941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1867901941} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:35:48,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} 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-26 23:35:48,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-963763914 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-963763914 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-963763914| ~x$w_buff0_used~0_In-963763914) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-963763914| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-963763914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-963763914} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-963763914|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-963763914, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-963763914} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:35:48,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-603085434 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-603085434 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-603085434 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-603085434 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-603085434| ~x$w_buff1_used~0_In-603085434) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-603085434| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-603085434, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-603085434, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-603085434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-603085434} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-603085434, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-603085434, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-603085434|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-603085434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-603085434} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:35:48,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2084653800 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2084653800 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-2084653800 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-2084653800 ~x$r_buff0_thd2~0_In-2084653800)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2084653800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2084653800} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2084653800|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2084653800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2084653800} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:35:48,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In386306204 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In386306204 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In386306204 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In386306204 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out386306204| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out386306204| ~x$r_buff1_thd2~0_In386306204) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In386306204, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In386306204, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In386306204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In386306204} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In386306204, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In386306204, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In386306204, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out386306204|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In386306204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:35:48,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, 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-26 23:35:48,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:35:48,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-334379171| |ULTIMATE.start_main_#t~ite24_Out-334379171|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-334379171 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-334379171 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In-334379171 |ULTIMATE.start_main_#t~ite24_Out-334379171|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~x~0_In-334379171 |ULTIMATE.start_main_#t~ite24_Out-334379171|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-334379171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-334379171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-334379171, ~x~0=~x~0_In-334379171} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-334379171, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-334379171|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-334379171|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-334379171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-334379171, ~x~0=~x~0_In-334379171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:35:48,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-88869627 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-88869627 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-88869627| ~x$w_buff0_used~0_In-88869627)) (and (= |ULTIMATE.start_main_#t~ite26_Out-88869627| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-88869627, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-88869627} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-88869627, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-88869627|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-88869627} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:35:48,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1091649778 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1091649778 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1091649778 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1091649778 256)))) (or (and (= ~x$w_buff1_used~0_In1091649778 |ULTIMATE.start_main_#t~ite27_Out1091649778|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1091649778|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1091649778, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1091649778, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1091649778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1091649778} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1091649778, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1091649778, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1091649778|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1091649778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1091649778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:35:48,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2103770716 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2103770716 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-2103770716|)) (and (= ~x$r_buff0_thd0~0_In-2103770716 |ULTIMATE.start_main_#t~ite28_Out-2103770716|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2103770716, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103770716} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2103770716, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-2103770716|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103770716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:35:48,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2073432309 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2073432309 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2073432309 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2073432309 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In2073432309 |ULTIMATE.start_main_#t~ite29_Out2073432309|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out2073432309|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2073432309, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2073432309, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2073432309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2073432309} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2073432309, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out2073432309|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2073432309, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2073432309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2073432309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:35:48,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:35:48,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:35:48,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:35:48,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:35:48 BasicIcfg [2019-12-26 23:35:48,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:35:48,451 INFO L168 Benchmark]: Toolchain (without parser) took 95371.51 ms. Allocated memory was 136.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 569.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:35:48,452 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:35:48,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.80 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.2 MB in the beginning and 154.1 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:35:48,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.92 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:35:48,454 INFO L168 Benchmark]: Boogie Preprocessor took 40.66 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:35:48,457 INFO L168 Benchmark]: RCFGBuilder took 1046.91 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 99.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:35:48,458 INFO L168 Benchmark]: TraceAbstraction took 93460.78 ms. Allocated memory was 200.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 505.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:35:48,464 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.80 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.2 MB in the beginning and 154.1 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.92 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.66 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1046.91 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 99.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93460.78 ms. Allocated memory was 200.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 505.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L807] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L809] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L733] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 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) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L815] 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) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L826] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L826] 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) [L827] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L827] 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)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L828] 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)) [L829] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L829] 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)) [L830] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L830] 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)) [L832] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L832] 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)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 93.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3975 SDtfs, 3381 SDslu, 8161 SDs, 0 SdLazy, 5416 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 61 SyntacticMatches, 23 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 103170 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1174 ConstructedInterpolants, 0 QuantifiedInterpolants, 198044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...