/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/rfi001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:10:32,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:10:32,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:10:32,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:10:32,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:10:32,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:10:32,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:10:32,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:10:32,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:10:32,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:10:32,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:10:32,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:10:32,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:10:32,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:10:32,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:10:32,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:10:32,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:10:32,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:10:32,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:10:32,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:10:32,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:10:32,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:10:32,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:10:32,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:10:32,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:10:32,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:10:32,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:10:32,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:10:32,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:10:32,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:10:32,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:10:32,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:10:32,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:10:32,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:10:32,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:10:32,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:10:32,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:10:32,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:10:32,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:10:32,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:10:32,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:10:32,746 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:10:32,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:10:32,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:10:32,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:10:32,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:10:32,763 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:10:32,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:10:32,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:10:32,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:10:32,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:10:32,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:10:32,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:10:32,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:10:32,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:10:32,764 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:10:32,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:10:32,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:10:32,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:10:32,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:10:32,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:10:32,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:10:32,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:10:32,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:10:32,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:10:32,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:10:32,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:10:32,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:10:32,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:10:32,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:10:32,767 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:10:32,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:10:33,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:10:33,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:10:33,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:10:33,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:10:33,051 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:10:33,052 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.oepc.i [2019-12-26 23:10:33,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e8f9ceb/78e8c50eec6a4cd78e1b8c043cd99964/FLAG24127e73d [2019-12-26 23:10:33,762 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:10:33,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.oepc.i [2019-12-26 23:10:33,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e8f9ceb/78e8c50eec6a4cd78e1b8c043cd99964/FLAG24127e73d [2019-12-26 23:10:34,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e8f9ceb/78e8c50eec6a4cd78e1b8c043cd99964 [2019-12-26 23:10:34,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:10:34,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:10:34,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:34,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:10:34,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:10:34,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34, skipping insertion in model container [2019-12-26 23:10:34,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:10:34,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:10:34,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:34,633 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:10:34,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:34,790 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:10:34,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34 WrapperNode [2019-12-26 23:10:34,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:34,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:34,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:10:34,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:10:34,801 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:10:34" (1/1) ... [2019-12-26 23:10:34,825 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:10:34" (1/1) ... [2019-12-26 23:10:34,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:34,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:10:34,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:10:34,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:10:34,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (1/1) ... [2019-12-26 23:10:34,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:10:34,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:10:34,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:10:34,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:10:34,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (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:10:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:10:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:10:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:10:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:10:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:10:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:10:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:10:34,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:10:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:10:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:10:34,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:10:34,991 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:10:35,707 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:10:35,708 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:10:35,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:35 BoogieIcfgContainer [2019-12-26 23:10:35,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:10:35,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:10:35,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:10:35,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:10:35,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:10:34" (1/3) ... [2019-12-26 23:10:35,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ae25ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:35, skipping insertion in model container [2019-12-26 23:10:35,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:34" (2/3) ... [2019-12-26 23:10:35,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ae25ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:35, skipping insertion in model container [2019-12-26 23:10:35,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:35" (3/3) ... [2019-12-26 23:10:35,722 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc.i [2019-12-26 23:10:35,733 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:10:35,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:10:35,745 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:10:35,746 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:10:35,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,786 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,786 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,789 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,805 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,877 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,884 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:35,906 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:10:35,928 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:10:35,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:10:35,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:10:35,929 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:10:35,929 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:10:35,929 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:10:35,929 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:10:35,929 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:10:35,952 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-26 23:10:35,954 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:36,064 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:36,064 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:36,081 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:36,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:36,174 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:36,174 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:36,179 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:36,194 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:10:36,195 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:10:40,531 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:10:41,004 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76598 [2019-12-26 23:10:41,004 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-26 23:10:41,008 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-26 23:10:41,493 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 23:10:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 23:10:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:10:41,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:41,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:10:41,503 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:41,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash 791334, now seen corresponding path program 1 times [2019-12-26 23:10:41,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:41,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146818124] [2019-12-26 23:10:41,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:41,710 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:10:41,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146818124] [2019-12-26 23:10:41,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:41,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:10:41,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100593435] [2019-12-26 23:10:41,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:41,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:41,736 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 23:10:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:42,022 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-26 23:10:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:42,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:10:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:42,224 INFO L225 Difference]: With dead ends: 8506 [2019-12-26 23:10:42,224 INFO L226 Difference]: Without dead ends: 7522 [2019-12-26 23:10:42,226 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:10:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-26 23:10:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-26 23:10:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-26 23:10:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-26 23:10:42,640 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-26 23:10:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:42,640 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-26 23:10:42,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-26 23:10:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:10:42,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:42,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:42,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:42,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:42,647 INFO L82 PathProgramCache]: Analyzing trace with hash -894599256, now seen corresponding path program 1 times [2019-12-26 23:10:42,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:42,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352387064] [2019-12-26 23:10:42,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:42,778 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:10:42,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352387064] [2019-12-26 23:10:42,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:42,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:42,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118476009] [2019-12-26 23:10:42,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:42,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:42,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:42,782 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-26 23:10:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:42,822 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-26 23:10:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:42,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:10:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:42,831 INFO L225 Difference]: With dead ends: 1232 [2019-12-26 23:10:42,832 INFO L226 Difference]: Without dead ends: 1232 [2019-12-26 23:10:42,834 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:10:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-26 23:10:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-26 23:10:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-26 23:10:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-26 23:10:42,880 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-26 23:10:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:42,881 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-26 23:10:42,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-26 23:10:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:10:42,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:42,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:42,891 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash 253726612, now seen corresponding path program 1 times [2019-12-26 23:10:42,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:42,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671171972] [2019-12-26 23:10:42,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:42,996 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:10:42,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671171972] [2019-12-26 23:10:42,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:42,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:42,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902176781] [2019-12-26 23:10:42,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:42,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:43,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:43,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:43,000 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-26 23:10:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:43,076 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-26 23:10:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:43,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:10:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:43,089 INFO L225 Difference]: With dead ends: 1960 [2019-12-26 23:10:43,089 INFO L226 Difference]: Without dead ends: 1960 [2019-12-26 23:10:43,090 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:10:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-26 23:10:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-26 23:10:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-26 23:10:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-26 23:10:43,142 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-26 23:10:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:43,143 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-26 23:10:43,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-26 23:10:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:10:43,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:43,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:43,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash 164472776, now seen corresponding path program 1 times [2019-12-26 23:10:43,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:43,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350328346] [2019-12-26 23:10:43,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:43,255 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:10:43,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350328346] [2019-12-26 23:10:43,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:43,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:43,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981078259] [2019-12-26 23:10:43,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:43,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:43,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:43,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:43,264 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-26 23:10:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:43,467 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-26 23:10:43,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:43,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:10:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:43,478 INFO L225 Difference]: With dead ends: 1706 [2019-12-26 23:10:43,479 INFO L226 Difference]: Without dead ends: 1706 [2019-12-26 23:10:43,479 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:10:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-26 23:10:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-26 23:10:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-26 23:10:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-26 23:10:43,578 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-26 23:10:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:43,579 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-26 23:10:43,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-26 23:10:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:10:43,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:43,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:43,581 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:43,581 INFO L82 PathProgramCache]: Analyzing trace with hash 930242268, now seen corresponding path program 1 times [2019-12-26 23:10:43,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:43,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189961089] [2019-12-26 23:10:43,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:43,667 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:10:43,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189961089] [2019-12-26 23:10:43,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:43,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:43,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147790868] [2019-12-26 23:10:43,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:43,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:43,669 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-26 23:10:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:43,907 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-26 23:10:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:43,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:10:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:43,921 INFO L225 Difference]: With dead ends: 2032 [2019-12-26 23:10:43,921 INFO L226 Difference]: Without dead ends: 2032 [2019-12-26 23:10:43,922 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:10:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-26 23:10:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-26 23:10:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-26 23:10:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-26 23:10:43,990 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-26 23:10:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:43,991 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-26 23:10:43,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-26 23:10:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:10:43,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:43,995 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:10:43,995 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455323, now seen corresponding path program 1 times [2019-12-26 23:10:43,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:43,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757223420] [2019-12-26 23:10:43,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:44,099 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:10:44,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757223420] [2019-12-26 23:10:44,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:44,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:44,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119639546] [2019-12-26 23:10:44,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:44,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:44,102 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-26 23:10:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:44,350 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-26 23:10:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:10:44,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 23:10:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:44,372 INFO L225 Difference]: With dead ends: 2284 [2019-12-26 23:10:44,372 INFO L226 Difference]: Without dead ends: 2284 [2019-12-26 23:10:44,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:10:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-26 23:10:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-26 23:10:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-26 23:10:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-26 23:10:44,434 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-26 23:10:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:44,434 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-26 23:10:44,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-26 23:10:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:10:44,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:44,437 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:10:44,438 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:44,438 INFO L82 PathProgramCache]: Analyzing trace with hash -381413792, now seen corresponding path program 1 times [2019-12-26 23:10:44,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:44,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974610786] [2019-12-26 23:10:44,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:44,519 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:10:44,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974610786] [2019-12-26 23:10:44,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:44,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:44,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326496501] [2019-12-26 23:10:44,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:44,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:44,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:44,522 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-26 23:10:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:44,582 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-26 23:10:44,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:44,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-26 23:10:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:44,610 INFO L225 Difference]: With dead ends: 2578 [2019-12-26 23:10:44,610 INFO L226 Difference]: Without dead ends: 2578 [2019-12-26 23:10:44,611 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:10:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-26 23:10:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-26 23:10:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-26 23:10:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-26 23:10:44,694 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-26 23:10:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:44,694 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-26 23:10:44,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-26 23:10:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:10:44,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:44,699 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] [2019-12-26 23:10:44,699 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135588, now seen corresponding path program 1 times [2019-12-26 23:10:44,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:44,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558090523] [2019-12-26 23:10:44,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:44,792 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:10:44,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558090523] [2019-12-26 23:10:44,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:44,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:44,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282376069] [2019-12-26 23:10:44,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:44,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:44,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:44,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:44,795 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-26 23:10:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:44,817 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-26 23:10:44,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:44,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 23:10:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:44,822 INFO L225 Difference]: With dead ends: 3111 [2019-12-26 23:10:44,822 INFO L226 Difference]: Without dead ends: 1431 [2019-12-26 23:10:44,822 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:10:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-26 23:10:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-26 23:10:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-26 23:10:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-26 23:10:44,856 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-26 23:10:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:44,857 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-26 23:10:44,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-26 23:10:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:10:44,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:44,859 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] [2019-12-26 23:10:44,860 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 501869478, now seen corresponding path program 1 times [2019-12-26 23:10:44,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:44,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976644964] [2019-12-26 23:10:44,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:44,961 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:10:44,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976644964] [2019-12-26 23:10:44,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:44,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:44,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13064753] [2019-12-26 23:10:44,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:44,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:44,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:44,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:44,965 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-26 23:10:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:45,110 INFO L93 Difference]: Finished difference Result 1416 states and 2988 transitions. [2019-12-26 23:10:45,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:10:45,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 23:10:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:45,116 INFO L225 Difference]: With dead ends: 1416 [2019-12-26 23:10:45,116 INFO L226 Difference]: Without dead ends: 1416 [2019-12-26 23:10:45,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:10:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-12-26 23:10:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1374. [2019-12-26 23:10:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-26 23:10:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2924 transitions. [2019-12-26 23:10:45,150 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2924 transitions. Word has length 26 [2019-12-26 23:10:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:45,152 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2924 transitions. [2019-12-26 23:10:45,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2924 transitions. [2019-12-26 23:10:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:10:45,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:45,156 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] [2019-12-26 23:10:45,156 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1828057274, now seen corresponding path program 1 times [2019-12-26 23:10:45,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:45,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961483849] [2019-12-26 23:10:45,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:45,242 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:10:45,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961483849] [2019-12-26 23:10:45,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:45,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:10:45,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820005827] [2019-12-26 23:10:45,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:45,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:45,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:45,245 INFO L87 Difference]: Start difference. First operand 1374 states and 2924 transitions. Second operand 5 states. [2019-12-26 23:10:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:45,778 INFO L93 Difference]: Finished difference Result 2192 states and 4592 transitions. [2019-12-26 23:10:45,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:10:45,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 23:10:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:45,783 INFO L225 Difference]: With dead ends: 2192 [2019-12-26 23:10:45,783 INFO L226 Difference]: Without dead ends: 2192 [2019-12-26 23:10:45,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-26 23:10:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1982. [2019-12-26 23:10:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-26 23:10:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4188 transitions. [2019-12-26 23:10:45,830 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4188 transitions. Word has length 27 [2019-12-26 23:10:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:45,830 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4188 transitions. [2019-12-26 23:10:45,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4188 transitions. [2019-12-26 23:10:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:10:45,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:45,834 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] [2019-12-26 23:10:45,834 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:45,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1516082769, now seen corresponding path program 1 times [2019-12-26 23:10:45,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:45,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129818854] [2019-12-26 23:10:45,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:45,893 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:10:45,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129818854] [2019-12-26 23:10:45,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:45,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:45,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858806440] [2019-12-26 23:10:45,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:45,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:45,895 INFO L87 Difference]: Start difference. First operand 1982 states and 4188 transitions. Second operand 4 states. [2019-12-26 23:10:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:45,914 INFO L93 Difference]: Finished difference Result 1109 states and 2212 transitions. [2019-12-26 23:10:45,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:10:45,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 23:10:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:45,917 INFO L225 Difference]: With dead ends: 1109 [2019-12-26 23:10:45,917 INFO L226 Difference]: Without dead ends: 1001 [2019-12-26 23:10:45,918 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:10:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-26 23:10:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 923. [2019-12-26 23:10:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-26 23:10:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1913 transitions. [2019-12-26 23:10:45,938 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1913 transitions. Word has length 28 [2019-12-26 23:10:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:45,938 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1913 transitions. [2019-12-26 23:10:45,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1913 transitions. [2019-12-26 23:10:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:10:45,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:45,941 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] [2019-12-26 23:10:45,941 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1905841279, now seen corresponding path program 1 times [2019-12-26 23:10:45,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:45,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057549645] [2019-12-26 23:10:45,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:46,032 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:10:46,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057549645] [2019-12-26 23:10:46,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:46,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:10:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327124546] [2019-12-26 23:10:46,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:10:46,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:10:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:46,034 INFO L87 Difference]: Start difference. First operand 923 states and 1913 transitions. Second operand 7 states. [2019-12-26 23:10:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:46,247 INFO L93 Difference]: Finished difference Result 1593 states and 3217 transitions. [2019-12-26 23:10:46,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:10:46,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:10:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:46,250 INFO L225 Difference]: With dead ends: 1593 [2019-12-26 23:10:46,251 INFO L226 Difference]: Without dead ends: 1060 [2019-12-26 23:10:46,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:10:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-26 23:10:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 922. [2019-12-26 23:10:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-12-26 23:10:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1886 transitions. [2019-12-26 23:10:46,270 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1886 transitions. Word has length 51 [2019-12-26 23:10:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:46,270 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1886 transitions. [2019-12-26 23:10:46,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:10:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1886 transitions. [2019-12-26 23:10:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:10:46,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:46,273 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] [2019-12-26 23:10:46,273 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1903876577, now seen corresponding path program 2 times [2019-12-26 23:10:46,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:46,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35091628] [2019-12-26 23:10:46,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:46,403 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:10:46,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35091628] [2019-12-26 23:10:46,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:46,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:10:46,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212704916] [2019-12-26 23:10:46,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:10:46,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:10:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:46,406 INFO L87 Difference]: Start difference. First operand 922 states and 1886 transitions. Second operand 6 states. [2019-12-26 23:10:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:46,840 INFO L93 Difference]: Finished difference Result 1079 states and 2184 transitions. [2019-12-26 23:10:46,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:10:46,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-26 23:10:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:46,847 INFO L225 Difference]: With dead ends: 1079 [2019-12-26 23:10:46,847 INFO L226 Difference]: Without dead ends: 1079 [2019-12-26 23:10:46,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:10:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-26 23:10:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 952. [2019-12-26 23:10:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-26 23:10:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1941 transitions. [2019-12-26 23:10:46,870 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1941 transitions. Word has length 51 [2019-12-26 23:10:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:46,871 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1941 transitions. [2019-12-26 23:10:46,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:10:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1941 transitions. [2019-12-26 23:10:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:10:46,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:46,874 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] [2019-12-26 23:10:46,875 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1732623143, now seen corresponding path program 3 times [2019-12-26 23:10:46,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:46,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197783133] [2019-12-26 23:10:46,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:46,980 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:10:46,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197783133] [2019-12-26 23:10:46,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:46,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:46,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23915412] [2019-12-26 23:10:46,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:46,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:46,982 INFO L87 Difference]: Start difference. First operand 952 states and 1941 transitions. Second operand 3 states. [2019-12-26 23:10:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:47,069 INFO L93 Difference]: Finished difference Result 1175 states and 2397 transitions. [2019-12-26 23:10:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:47,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:10:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:47,079 INFO L225 Difference]: With dead ends: 1175 [2019-12-26 23:10:47,079 INFO L226 Difference]: Without dead ends: 1175 [2019-12-26 23:10:47,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:10:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-12-26 23:10:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 931. [2019-12-26 23:10:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-26 23:10:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-26 23:10:47,101 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-26 23:10:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:47,105 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-26 23:10:47,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-26 23:10:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:10:47,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:47,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:47,108 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1330853335, now seen corresponding path program 1 times [2019-12-26 23:10:47,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:47,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490025340] [2019-12-26 23:10:47,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:47,235 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:10:47,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490025340] [2019-12-26 23:10:47,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:47,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:47,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791091914] [2019-12-26 23:10:47,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:47,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:47,237 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 3 states. [2019-12-26 23:10:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:47,251 INFO L93 Difference]: Finished difference Result 931 states and 1918 transitions. [2019-12-26 23:10:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:47,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:10:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:47,255 INFO L225 Difference]: With dead ends: 931 [2019-12-26 23:10:47,255 INFO L226 Difference]: Without dead ends: 931 [2019-12-26 23:10:47,258 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:10:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-26 23:10:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 814. [2019-12-26 23:10:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-12-26 23:10:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1697 transitions. [2019-12-26 23:10:47,285 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1697 transitions. Word has length 52 [2019-12-26 23:10:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:47,286 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1697 transitions. [2019-12-26 23:10:47,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1697 transitions. [2019-12-26 23:10:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:10:47,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:47,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:47,289 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1920865598, now seen corresponding path program 1 times [2019-12-26 23:10:47,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:47,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661983071] [2019-12-26 23:10:47,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:47,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:10:47,513 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:10:47,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1605~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1605~0.base_31|) |v_ULTIMATE.start_main_~#t1605~0.offset_23| 0)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1605~0.offset_23| 0) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_31|)) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1605~0.base_31| 4)) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1605~0.base_31|) (= 0 v_~x$r_buff0_thd2~0_279) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_31| 1)) (= 0 v_~x~0_116) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_~#t1605~0.base=|v_ULTIMATE.start_main_~#t1605~0.base_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1605~0.offset=|v_ULTIMATE.start_main_~#t1605~0.offset_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_19|, ~y~0=v_~y~0_95, ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1605~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1605~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1606~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1606~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:10:47,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~x$r_buff1_thd2~0_Out1315188642 ~x$r_buff0_thd2~0_In1315188642) (= ~x$r_buff1_thd1~0_Out1315188642 ~x$r_buff0_thd1~0_In1315188642) (= ~x$r_buff1_thd0~0_Out1315188642 ~x$r_buff0_thd0~0_In1315188642) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1315188642)) (= ~y~0_Out1315188642 1) (= 1 ~x$r_buff0_thd1~0_Out1315188642)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1315188642, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1315188642, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1315188642, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1315188642} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1315188642, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1315188642, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1315188642, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1315188642, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1315188642, ~y~0=~y~0_Out1315188642, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1315188642, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1315188642} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:10:47,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t1606~0.offset_10| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11|) |v_ULTIMATE.start_main_~#t1606~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1606~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1606~0.base_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1606~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1606~0.offset, ULTIMATE.start_main_~#t1606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 23:10:47,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In981590520 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In981590520 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out981590520| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In981590520 |P0Thread1of1ForFork0_#t~ite5_Out981590520|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In981590520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In981590520} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out981590520|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In981590520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In981590520} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:10:47,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-312491981 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-312491981 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-312491981 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-312491981 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-312491981|)) (and (= ~x$w_buff1_used~0_In-312491981 |P0Thread1of1ForFork0_#t~ite6_Out-312491981|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-312491981, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-312491981, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-312491981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-312491981} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-312491981|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-312491981, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-312491981, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-312491981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-312491981} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:10:47,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-995471989 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-995471989 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-995471989)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_Out-995471989 ~x$r_buff0_thd1~0_In-995471989)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-995471989, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-995471989} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-995471989, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-995471989|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-995471989} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:10:47,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1252227137 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1252227137 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1252227137 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1252227137 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1252227137| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-1252227137| ~x$r_buff1_thd1~0_In-1252227137) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1252227137, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1252227137, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1252227137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252227137} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1252227137, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1252227137|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1252227137, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1252227137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252227137} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:10:47,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ 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_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, 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_63} 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:10:47,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:10:47,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1064240723 256)))) (or (and (= ~x$r_buff1_thd2~0_In1064240723 |P1Thread1of1ForFork1_#t~ite30_Out1064240723|) (= |P1Thread1of1ForFork1_#t~ite29_In1064240723| |P1Thread1of1ForFork1_#t~ite29_Out1064240723|) (not .cse0)) (and (= ~x$r_buff1_thd2~0_In1064240723 |P1Thread1of1ForFork1_#t~ite29_Out1064240723|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1064240723 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1064240723 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1064240723 256)) .cse1) (and (= (mod ~x$r_buff1_thd2~0_In1064240723 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1064240723| |P1Thread1of1ForFork1_#t~ite29_Out1064240723|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1064240723|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1064240723, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1064240723, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1064240723, ~weak$$choice2~0=~weak$$choice2~0_In1064240723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1064240723} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1064240723|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1064240723|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1064240723, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1064240723, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1064240723, ~weak$$choice2~0=~weak$$choice2~0_In1064240723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1064240723} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:10:47,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-26 23:10:47,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-227094097 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-227094097 256)))) (or (and (= ~x~0_In-227094097 |P1Thread1of1ForFork1_#t~ite32_Out-227094097|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-227094097| ~x$w_buff1~0_In-227094097) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-227094097, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-227094097, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-227094097, ~x~0=~x~0_In-227094097} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-227094097, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-227094097, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-227094097, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-227094097|, ~x~0=~x~0_In-227094097} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:10:47,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:10:47,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1216450566 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1216450566 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1216450566 |P1Thread1of1ForFork1_#t~ite34_Out-1216450566|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1216450566|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1216450566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1216450566} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1216450566|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1216450566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1216450566} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:10:47,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1114801469 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1114801469 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1114801469 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1114801469 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1114801469|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1114801469 |P1Thread1of1ForFork1_#t~ite35_Out-1114801469|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1114801469, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1114801469, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1114801469, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114801469} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1114801469, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1114801469, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1114801469|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1114801469, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114801469} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:10:47,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1941976515 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1941976515 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1941976515| ~x$r_buff0_thd2~0_In-1941976515) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1941976515| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1941976515, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941976515} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1941976515, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1941976515|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941976515} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:10:47,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1918308472 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1918308472 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1918308472 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1918308472 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1918308472 |P1Thread1of1ForFork1_#t~ite37_Out1918308472|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1918308472|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1918308472, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1918308472, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1918308472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1918308472} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1918308472, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1918308472, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1918308472, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1918308472|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1918308472} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:10:47,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_24|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:10:47,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:10:47,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-24718712| |ULTIMATE.start_main_#t~ite40_Out-24718712|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-24718712 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-24718712 256)))) (or (and (= ~x$w_buff1~0_In-24718712 |ULTIMATE.start_main_#t~ite40_Out-24718712|) .cse0 (not .cse1) (not .cse2)) (and (= ~x~0_In-24718712 |ULTIMATE.start_main_#t~ite40_Out-24718712|) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-24718712, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-24718712, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-24718712, ~x~0=~x~0_In-24718712} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-24718712|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-24718712|, ~x$w_buff1~0=~x$w_buff1~0_In-24718712, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-24718712, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-24718712, ~x~0=~x~0_In-24718712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:10:47,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1919377755 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1919377755 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1919377755| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out1919377755| ~x$w_buff0_used~0_In1919377755) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1919377755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1919377755} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1919377755, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1919377755|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1919377755} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:10:47,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1430022851 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1430022851 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1430022851 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1430022851 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1430022851|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1430022851 |ULTIMATE.start_main_#t~ite43_Out1430022851|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1430022851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430022851, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1430022851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430022851} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1430022851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1430022851, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1430022851|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1430022851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430022851} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:10:47,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-913641583 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-913641583 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-913641583|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-913641583 |ULTIMATE.start_main_#t~ite44_Out-913641583|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-913641583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-913641583} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-913641583, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-913641583|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-913641583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:10:47,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In2142181598 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2142181598 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2142181598 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In2142181598 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2142181598| ~x$r_buff1_thd0~0_In2142181598) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out2142181598| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2142181598, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2142181598, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2142181598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2142181598} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2142181598, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2142181598, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2142181598, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2142181598|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2142181598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:10:47,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:10:47,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:10:47 BasicIcfg [2019-12-26 23:10:47,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:10:47,655 INFO L168 Benchmark]: Toolchain (without parser) took 13601.43 ms. Allocated memory was 138.4 MB in the beginning and 448.3 MB in the end (delta: 309.9 MB). Free memory was 100.4 MB in the beginning and 287.2 MB in the end (delta: -186.8 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:47,656 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-26 23:10:47,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.96 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 157.2 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:47,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.11 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.5 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:10:47,662 INFO L168 Benchmark]: Boogie Preprocessor took 40.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:47,663 INFO L168 Benchmark]: RCFGBuilder took 813.82 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 107.9 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:47,663 INFO L168 Benchmark]: TraceAbstraction took 11941.66 ms. Allocated memory was 202.9 MB in the beginning and 448.3 MB in the end (delta: 245.4 MB). Free memory was 107.9 MB in the beginning and 287.2 MB in the end (delta: -179.3 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:47,667 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.96 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 157.2 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.11 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.82 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 107.9 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11941.66 ms. Allocated memory was 202.9 MB in the beginning and 448.3 MB in the end (delta: 245.4 MB). Free memory was 107.9 MB in the beginning and 287.2 MB in the end (delta: -179.3 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 25 ChoiceCompositions, 4597 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 76598 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 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) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 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 [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 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) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 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 [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1836 SDtfs, 1193 SDslu, 2937 SDs, 0 SdLazy, 1590 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 2728 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 65271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...