/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/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:24:59,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:24:59,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:24:59,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:24:59,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:24:59,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:24:59,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:24:59,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:24:59,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:24:59,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:24:59,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:24:59,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:24:59,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:24:59,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:24:59,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:24:59,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:24:59,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:24:59,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:24:59,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:24:59,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:24:59,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:24:59,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:24:59,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:24:59,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:24:59,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:24:59,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:24:59,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:24:59,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:24:59,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:24:59,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:24:59,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:24:59,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:24:59,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:24:59,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:24:59,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:24:59,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:24:59,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:24:59,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:24:59,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:24:59,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:24:59,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:24:59,724 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:24:59,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:24:59,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:24:59,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:24:59,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:24:59,740 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:24:59,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:24:59,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:24:59,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:24:59,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:24:59,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:24:59,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:24:59,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:24:59,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:24:59,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:24:59,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:24:59,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:24:59,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:24:59,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:24:59,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:24:59,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:24:59,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:24:59,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:24:59,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:24:59,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:24:59,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:24:59,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:24:59,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:24:59,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:24:59,745 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:24:59,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:25:00,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:25:00,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:25:00,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:25:00,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:25:00,060 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:25:00,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-26 23:25:00,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb1c688f/f3cac406ba254ac19449cb363ed46e34/FLAGb0366f9a9 [2019-12-26 23:25:00,745 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:25:00,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-26 23:25:00,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb1c688f/f3cac406ba254ac19449cb363ed46e34/FLAGb0366f9a9 [2019-12-26 23:25:01,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb1c688f/f3cac406ba254ac19449cb363ed46e34 [2019-12-26 23:25:01,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:25:01,011 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:25:01,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:25:01,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:25:01,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:25:01,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01, skipping insertion in model container [2019-12-26 23:25:01,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:25:01,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:25:01,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:25:01,669 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:25:01,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:25:01,824 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:25:01,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01 WrapperNode [2019-12-26 23:25:01,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:25:01,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:25:01,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:25:01,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:25:01,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,874 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:25:01" (1/1) ... [2019-12-26 23:25:01,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:25:01,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:25:01,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:25:01,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:25:01,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (1/1) ... [2019-12-26 23:25:01,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:25:01,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:25:01,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:25:01,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:25:01,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (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:25:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:25:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:25:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:25:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:25:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:25:02,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:25:02,041 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:25:02,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:25:02,041 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:25:02,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:25:02,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:25:02,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:25:02,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:25:02,044 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:25:02,815 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:25:02,815 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:25:02,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:25:02 BoogieIcfgContainer [2019-12-26 23:25:02,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:25:02,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:25:02,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:25:02,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:25:02,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:25:01" (1/3) ... [2019-12-26 23:25:02,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587bdfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:25:02, skipping insertion in model container [2019-12-26 23:25:02,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:01" (2/3) ... [2019-12-26 23:25:02,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587bdfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:25:02, skipping insertion in model container [2019-12-26 23:25:02,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:25:02" (3/3) ... [2019-12-26 23:25:02,826 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2019-12-26 23:25:02,837 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:25:02,838 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:25:02,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:25:02,847 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:25:02,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,904 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,904 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,957 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:25:02,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:25:02,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:25:02,992 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:25:02,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:25:02,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:25:02,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:25:02,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:25:02,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:25:02,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:25:03,008 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:25:03,010 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:25:03,130 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:25:03,130 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:25:03,149 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:25:03,170 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:25:03,246 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:25:03,246 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:25:03,256 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:25:03,275 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 23:25:03,277 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:25:08,203 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:25:08,340 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:25:08,368 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-26 23:25:08,369 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 23:25:08,373 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-26 23:25:24,452 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-26 23:25:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-26 23:25:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:25:24,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:25:24,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:25:24,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:25:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:25:24,467 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-26 23:25:24,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:25:24,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908797481] [2019-12-26 23:25:24,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:25:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:25:24,717 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:25:24,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908797481] [2019-12-26 23:25:24,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:25:24,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:25:24,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707844700] [2019-12-26 23:25:24,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:25:24,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:25:24,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:25:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:25:24,745 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-26 23:25:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:25:28,263 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-26 23:25:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:25:28,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:25:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:25:28,977 INFO L225 Difference]: With dead ends: 107108 [2019-12-26 23:25:28,977 INFO L226 Difference]: Without dead ends: 104924 [2019-12-26 23:25:28,978 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:25:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-26 23:25:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-26 23:25:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-26 23:25:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-26 23:25:39,684 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-26 23:25:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:25:39,684 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-26 23:25:39,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:25:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-26 23:25:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:25:39,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:25:39,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:25:39,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:25:39,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:25:39,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-26 23:25:39,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:25:39,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704785456] [2019-12-26 23:25:39,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:25:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:25:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:25:39,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704785456] [2019-12-26 23:25:39,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:25:39,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:25:39,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321495936] [2019-12-26 23:25:39,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:25:39,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:25:39,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:25:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:25:39,841 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-26 23:25:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:25:45,085 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-26 23:25:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:25:45,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:25:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:25:45,678 INFO L225 Difference]: With dead ends: 168606 [2019-12-26 23:25:45,678 INFO L226 Difference]: Without dead ends: 168557 [2019-12-26 23:25:45,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:25:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-26 23:25:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-26 23:25:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-26 23:25:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-26 23:25:54,423 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-26 23:25:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:25:54,424 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-26 23:25:54,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:25:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-26 23:25:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:25:54,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:25:54,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:25:54,433 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:25:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:25:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-26 23:25:54,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:25:54,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463134583] [2019-12-26 23:25:54,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:25:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:25:54,543 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:25:54,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463134583] [2019-12-26 23:25:54,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:25:54,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:25:54,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292561980] [2019-12-26 23:25:54,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:25:54,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:25:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:25:54,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:25:54,548 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-26 23:26:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:01,047 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-26 23:26:01,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:26:01,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:26:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:01,767 INFO L225 Difference]: With dead ends: 217678 [2019-12-26 23:26:01,767 INFO L226 Difference]: Without dead ends: 217615 [2019-12-26 23:26:01,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:26:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-26 23:26:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-26 23:26:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-26 23:26:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-26 23:26:21,223 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-26 23:26:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:21,225 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-26 23:26:21,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:26:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-26 23:26:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:26:21,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:21,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:21,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-26 23:26:21,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:21,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074234353] [2019-12-26 23:26:21,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:21,278 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:26:21,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074234353] [2019-12-26 23:26:21,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:21,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:26:21,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649853537] [2019-12-26 23:26:21,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:26:21,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:21,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:26:21,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:26:21,280 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-26 23:26:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:21,408 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-26 23:26:21,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:26:21,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:26:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:21,481 INFO L225 Difference]: With dead ends: 36985 [2019-12-26 23:26:21,481 INFO L226 Difference]: Without dead ends: 36985 [2019-12-26 23:26:21,482 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:26:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-26 23:26:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-26 23:26:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-26 23:26:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-26 23:26:22,170 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-26 23:26:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:22,170 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-26 23:26:22,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:26:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-26 23:26:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:26:22,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:22,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:22,174 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-26 23:26:22,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:22,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139545522] [2019-12-26 23:26:22,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:22,289 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:26:22,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139545522] [2019-12-26 23:26:22,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:22,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:26:22,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779290224] [2019-12-26 23:26:22,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:26:22,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:26:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:26:22,291 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 6 states. [2019-12-26 23:26:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:26,026 INFO L93 Difference]: Finished difference Result 51224 states and 162226 transitions. [2019-12-26 23:26:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:26:26,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-26 23:26:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:26,124 INFO L225 Difference]: With dead ends: 51224 [2019-12-26 23:26:26,125 INFO L226 Difference]: Without dead ends: 51217 [2019-12-26 23:26:26,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:26:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51217 states. [2019-12-26 23:26:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51217 to 37313. [2019-12-26 23:26:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37313 states. [2019-12-26 23:26:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37313 states to 37313 states and 121596 transitions. [2019-12-26 23:26:26,906 INFO L78 Accepts]: Start accepts. Automaton has 37313 states and 121596 transitions. Word has length 19 [2019-12-26 23:26:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:26,906 INFO L462 AbstractCegarLoop]: Abstraction has 37313 states and 121596 transitions. [2019-12-26 23:26:26,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:26:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 37313 states and 121596 transitions. [2019-12-26 23:26:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:26:26,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:26,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:26,911 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:26,912 INFO L82 PathProgramCache]: Analyzing trace with hash -159037504, now seen corresponding path program 2 times [2019-12-26 23:26:26,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:26,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489320944] [2019-12-26 23:26:26,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:27,169 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:26:27,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489320944] [2019-12-26 23:26:27,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:27,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:26:27,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727205582] [2019-12-26 23:26:27,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:26:27,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:27,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:26:27,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:26:27,172 INFO L87 Difference]: Start difference. First operand 37313 states and 121596 transitions. Second operand 7 states. [2019-12-26 23:26:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:28,750 INFO L93 Difference]: Finished difference Result 51772 states and 164281 transitions. [2019-12-26 23:26:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:26:28,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-26 23:26:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:28,833 INFO L225 Difference]: With dead ends: 51772 [2019-12-26 23:26:28,834 INFO L226 Difference]: Without dead ends: 51765 [2019-12-26 23:26:28,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:26:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51765 states. [2019-12-26 23:26:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51765 to 37328. [2019-12-26 23:26:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-26 23:26:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121554 transitions. [2019-12-26 23:26:29,551 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121554 transitions. Word has length 19 [2019-12-26 23:26:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:29,551 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121554 transitions. [2019-12-26 23:26:29,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:26:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121554 transitions. [2019-12-26 23:26:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:26:29,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:29,560 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:26:29,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:29,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-26 23:26:29,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:29,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171633049] [2019-12-26 23:26:29,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:29,612 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:26:29,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171633049] [2019-12-26 23:26:29,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:29,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:26:29,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150049731] [2019-12-26 23:26:29,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:26:29,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:29,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:26:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:26:29,615 INFO L87 Difference]: Start difference. First operand 37328 states and 121554 transitions. Second operand 4 states. [2019-12-26 23:26:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:29,653 INFO L93 Difference]: Finished difference Result 7104 states and 19419 transitions. [2019-12-26 23:26:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:26:29,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:26:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:29,663 INFO L225 Difference]: With dead ends: 7104 [2019-12-26 23:26:29,663 INFO L226 Difference]: Without dead ends: 7104 [2019-12-26 23:26:29,663 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:26:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-26 23:26:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-26 23:26:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-26 23:26:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19099 transitions. [2019-12-26 23:26:29,754 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19099 transitions. Word has length 25 [2019-12-26 23:26:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:29,755 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19099 transitions. [2019-12-26 23:26:29,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:26:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19099 transitions. [2019-12-26 23:26:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:26:29,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:29,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:29,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-26 23:26:29,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:29,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785755429] [2019-12-26 23:26:29,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:29,832 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:26:29,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785755429] [2019-12-26 23:26:29,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:29,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:26:29,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29511037] [2019-12-26 23:26:29,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:26:29,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:26:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:26:29,834 INFO L87 Difference]: Start difference. First operand 6992 states and 19099 transitions. Second operand 5 states. [2019-12-26 23:26:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:29,871 INFO L93 Difference]: Finished difference Result 5024 states and 14409 transitions. [2019-12-26 23:26:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:26:29,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:26:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:29,878 INFO L225 Difference]: With dead ends: 5024 [2019-12-26 23:26:29,879 INFO L226 Difference]: Without dead ends: 5024 [2019-12-26 23:26:29,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:26:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-26 23:26:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-26 23:26:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-26 23:26:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13425 transitions. [2019-12-26 23:26:29,945 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13425 transitions. Word has length 37 [2019-12-26 23:26:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:29,945 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13425 transitions. [2019-12-26 23:26:29,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:26:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13425 transitions. [2019-12-26 23:26:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:26:29,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:29,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:29,954 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-26 23:26:29,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:29,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079141710] [2019-12-26 23:26:29,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:30,027 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:26:30,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079141710] [2019-12-26 23:26:30,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:30,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:26:30,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871788924] [2019-12-26 23:26:30,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:26:30,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:26:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:26:30,030 INFO L87 Difference]: Start difference. First operand 4660 states and 13425 transitions. Second operand 3 states. [2019-12-26 23:26:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:30,085 INFO L93 Difference]: Finished difference Result 4669 states and 13438 transitions. [2019-12-26 23:26:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:26:30,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:26:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:30,093 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:26:30,093 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:26:30,094 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:26:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:26:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:26:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:26:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13434 transitions. [2019-12-26 23:26:30,173 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13434 transitions. Word has length 65 [2019-12-26 23:26:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:30,173 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13434 transitions. [2019-12-26 23:26:30,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:26:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13434 transitions. [2019-12-26 23:26:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:26:30,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:30,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:30,180 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-26 23:26:30,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:30,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218980243] [2019-12-26 23:26:30,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:30,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:26:30,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218980243] [2019-12-26 23:26:30,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:30,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:26:30,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980882649] [2019-12-26 23:26:30,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:26:30,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:30,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:26:30,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:26:30,244 INFO L87 Difference]: Start difference. First operand 4665 states and 13434 transitions. Second operand 3 states. [2019-12-26 23:26:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:30,295 INFO L93 Difference]: Finished difference Result 4669 states and 13429 transitions. [2019-12-26 23:26:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:26:30,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:26:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:30,303 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:26:30,303 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:26:30,303 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:26:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:26:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:26:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:26:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13425 transitions. [2019-12-26 23:26:30,371 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13425 transitions. Word has length 65 [2019-12-26 23:26:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:30,371 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13425 transitions. [2019-12-26 23:26:30,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:26:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13425 transitions. [2019-12-26 23:26:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:26:30,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:30,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:30,378 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-26 23:26:30,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:30,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974094745] [2019-12-26 23:26:30,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:30,480 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:26:30,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974094745] [2019-12-26 23:26:30,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:30,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:26:30,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32708756] [2019-12-26 23:26:30,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:26:30,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:26:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:26:30,583 INFO L87 Difference]: Start difference. First operand 4665 states and 13425 transitions. Second operand 3 states. [2019-12-26 23:26:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:30,630 INFO L93 Difference]: Finished difference Result 4413 states and 12520 transitions. [2019-12-26 23:26:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:26:30,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:26:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:30,638 INFO L225 Difference]: With dead ends: 4413 [2019-12-26 23:26:30,638 INFO L226 Difference]: Without dead ends: 4413 [2019-12-26 23:26:30,639 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:26:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-26 23:26:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4413. [2019-12-26 23:26:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4413 states. [2019-12-26 23:26:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 12520 transitions. [2019-12-26 23:26:30,737 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 12520 transitions. Word has length 65 [2019-12-26 23:26:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:30,737 INFO L462 AbstractCegarLoop]: Abstraction has 4413 states and 12520 transitions. [2019-12-26 23:26:30,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:26:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 12520 transitions. [2019-12-26 23:26:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:26:30,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:30,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:30,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash 981685475, now seen corresponding path program 1 times [2019-12-26 23:26:30,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:30,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297413379] [2019-12-26 23:26:30,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:30,864 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:26:30,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297413379] [2019-12-26 23:26:30,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:30,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:26:30,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811522421] [2019-12-26 23:26:30,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:26:30,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:26:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:26:30,867 INFO L87 Difference]: Start difference. First operand 4413 states and 12520 transitions. Second operand 3 states. [2019-12-26 23:26:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:30,894 INFO L93 Difference]: Finished difference Result 4413 states and 12340 transitions. [2019-12-26 23:26:30,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:26:30,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:26:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:30,901 INFO L225 Difference]: With dead ends: 4413 [2019-12-26 23:26:30,901 INFO L226 Difference]: Without dead ends: 4413 [2019-12-26 23:26:30,902 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:26:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-26 23:26:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4413. [2019-12-26 23:26:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4413 states. [2019-12-26 23:26:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 12340 transitions. [2019-12-26 23:26:30,995 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 12340 transitions. Word has length 66 [2019-12-26 23:26:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:30,996 INFO L462 AbstractCegarLoop]: Abstraction has 4413 states and 12340 transitions. [2019-12-26 23:26:30,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:26:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 12340 transitions. [2019-12-26 23:26:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:26:31,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:31,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:31,004 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1724172683, now seen corresponding path program 1 times [2019-12-26 23:26:31,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:31,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573745463] [2019-12-26 23:26:31,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:31,090 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:26:31,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573745463] [2019-12-26 23:26:31,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:31,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:26:31,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031645347] [2019-12-26 23:26:31,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:26:31,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:26:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:26:31,092 INFO L87 Difference]: Start difference. First operand 4413 states and 12340 transitions. Second operand 5 states. [2019-12-26 23:26:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:31,370 INFO L93 Difference]: Finished difference Result 6679 states and 18593 transitions. [2019-12-26 23:26:31,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:26:31,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-26 23:26:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:31,379 INFO L225 Difference]: With dead ends: 6679 [2019-12-26 23:26:31,380 INFO L226 Difference]: Without dead ends: 6679 [2019-12-26 23:26:31,380 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:26:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2019-12-26 23:26:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 5169. [2019-12-26 23:26:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5169 states. [2019-12-26 23:26:31,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 14506 transitions. [2019-12-26 23:26:31,456 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 14506 transitions. Word has length 67 [2019-12-26 23:26:31,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:31,457 INFO L462 AbstractCegarLoop]: Abstraction has 5169 states and 14506 transitions. [2019-12-26 23:26:31,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:26:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 14506 transitions. [2019-12-26 23:26:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:26:31,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:31,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:31,464 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1093155317, now seen corresponding path program 2 times [2019-12-26 23:26:31,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:31,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422885641] [2019-12-26 23:26:31,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:31,577 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:26:31,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422885641] [2019-12-26 23:26:31,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:31,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:26:31,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395474034] [2019-12-26 23:26:31,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:26:31,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:26:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:26:31,580 INFO L87 Difference]: Start difference. First operand 5169 states and 14506 transitions. Second operand 3 states. [2019-12-26 23:26:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:31,637 INFO L93 Difference]: Finished difference Result 5169 states and 14505 transitions. [2019-12-26 23:26:31,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:26:31,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:26:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:31,645 INFO L225 Difference]: With dead ends: 5169 [2019-12-26 23:26:31,645 INFO L226 Difference]: Without dead ends: 5169 [2019-12-26 23:26:31,646 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:26:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-12-26 23:26:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 2988. [2019-12-26 23:26:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-26 23:26:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 8451 transitions. [2019-12-26 23:26:31,724 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 8451 transitions. Word has length 67 [2019-12-26 23:26:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:31,724 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 8451 transitions. [2019-12-26 23:26:31,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:26:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 8451 transitions. [2019-12-26 23:26:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:26:31,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:31,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:31,730 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1652885238, now seen corresponding path program 1 times [2019-12-26 23:26:31,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:31,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940587035] [2019-12-26 23:26:31,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:31,915 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:26:31,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940587035] [2019-12-26 23:26:31,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:31,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:26:31,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855178890] [2019-12-26 23:26:31,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:26:31,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:26:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:26:31,917 INFO L87 Difference]: Start difference. First operand 2988 states and 8451 transitions. Second operand 6 states. [2019-12-26 23:26:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:32,019 INFO L93 Difference]: Finished difference Result 5343 states and 15110 transitions. [2019-12-26 23:26:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:26:32,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-26 23:26:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:32,023 INFO L225 Difference]: With dead ends: 5343 [2019-12-26 23:26:32,024 INFO L226 Difference]: Without dead ends: 2843 [2019-12-26 23:26:32,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:26:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-26 23:26:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2447. [2019-12-26 23:26:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-26 23:26:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 6867 transitions. [2019-12-26 23:26:32,078 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 6867 transitions. Word has length 68 [2019-12-26 23:26:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:32,078 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 6867 transitions. [2019-12-26 23:26:32,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:26:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 6867 transitions. [2019-12-26 23:26:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:26:32,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:32,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:32,083 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash 942277324, now seen corresponding path program 2 times [2019-12-26 23:26:32,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:32,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944923974] [2019-12-26 23:26:32,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:26:32,223 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:26:32,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944923974] [2019-12-26 23:26:32,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:26:32,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:26:32,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900219473] [2019-12-26 23:26:32,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:26:32,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:26:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:26:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:26:32,227 INFO L87 Difference]: Start difference. First operand 2447 states and 6867 transitions. Second operand 7 states. [2019-12-26 23:26:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:26:32,332 INFO L93 Difference]: Finished difference Result 4939 states and 13924 transitions. [2019-12-26 23:26:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:26:32,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-26 23:26:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:26:32,336 INFO L225 Difference]: With dead ends: 4939 [2019-12-26 23:26:32,336 INFO L226 Difference]: Without dead ends: 2668 [2019-12-26 23:26:32,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:26:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-12-26 23:26:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2200. [2019-12-26 23:26:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-12-26 23:26:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 6194 transitions. [2019-12-26 23:26:32,388 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 6194 transitions. Word has length 68 [2019-12-26 23:26:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:26:32,388 INFO L462 AbstractCegarLoop]: Abstraction has 2200 states and 6194 transitions. [2019-12-26 23:26:32,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:26:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 6194 transitions. [2019-12-26 23:26:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:26:32,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:26:32,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:26:32,393 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:26:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:26:32,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 3 times [2019-12-26 23:26:32,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:26:32,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715134847] [2019-12-26 23:26:32,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:26:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:26:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:26:32,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:26:32,532 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:26:32,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1807~0.base_20|) (= 0 v_~x$w_buff0~0_268) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1807~0.base_20| 4) |v_#length_25|) (= 0 |v_ULTIMATE.start_main_~#t1807~0.offset_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20|)) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20|) |v_ULTIMATE.start_main_~#t1807~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20| 1)) (= v_~x$r_buff1_thd1~0_187 0) (= v_~x$r_buff0_thd0~0_372 0) (= v_~y~0_143 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_17|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1807~0.offset=|v_ULTIMATE.start_main_~#t1807~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_16|, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_21|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ULTIMATE.start_main_~#t1807~0.base=|v_ULTIMATE.start_main_~#t1807~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1808~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1807~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1809~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1809~0.offset, ~y~0, ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1807~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:26:32,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1808~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11|) |v_ULTIMATE.start_main_~#t1808~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1808~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1808~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1808~0.offset] because there is no mapped edge [2019-12-26 23:26:32,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_ULTIMATE.start_main_~#t1809~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1809~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1809~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9|) |v_ULTIMATE.start_main_~#t1809~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1809~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1809~0.offset, #length, ULTIMATE.start_main_~#t1809~0.base] because there is no mapped edge [2019-12-26 23:26:32,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:26:32,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In943277291 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In943277291 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out943277291| ~x$w_buff1~0_In943277291) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out943277291| ~x~0_In943277291) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In943277291, ~x$w_buff1_used~0=~x$w_buff1_used~0_In943277291, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In943277291, ~x~0=~x~0_In943277291} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out943277291|, ~x$w_buff1~0=~x$w_buff1~0_In943277291, ~x$w_buff1_used~0=~x$w_buff1_used~0_In943277291, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In943277291, ~x~0=~x~0_In943277291} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:26:32,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 23:26:32,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1826116693 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1826116693 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1826116693| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1826116693| ~x$w_buff0_used~0_In-1826116693)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1826116693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1826116693} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1826116693, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1826116693|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1826116693} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:26:32,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1666984628 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1666984628 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1666984628 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1666984628 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out1666984628| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite18_Out1666984628| ~x$w_buff1_used~0_In1666984628)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1666984628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1666984628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1666984628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1666984628} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1666984628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1666984628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1666984628, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1666984628|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1666984628} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:26:32,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1546334785 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1546334785| |P0Thread1of1ForFork0_#t~ite3_Out-1546334785|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1546334785 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-1546334785| ~x~0_In-1546334785)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1546334785| ~x$w_buff1~0_In-1546334785) (not .cse0) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1546334785, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546334785, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1546334785, ~x~0=~x~0_In-1546334785} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1546334785|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1546334785|, ~x$w_buff1~0=~x$w_buff1~0_In-1546334785, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546334785, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1546334785, ~x~0=~x~0_In-1546334785} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:26:32,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1893079767 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1893079767 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1893079767| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1893079767| ~x$w_buff0_used~0_In-1893079767)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1893079767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1893079767} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1893079767|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1893079767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1893079767} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:26:32,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1667559447 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1667559447 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1667559447 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1667559447 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out1667559447| ~x$w_buff1_used~0_In1667559447) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1667559447| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1667559447, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667559447, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1667559447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667559447} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1667559447|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1667559447, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667559447, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1667559447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667559447} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:26:32,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1366004394 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1366004394 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out1366004394| ~x$r_buff0_thd3~0_In1366004394) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1366004394|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1366004394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1366004394} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1366004394, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1366004394|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1366004394} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:26:32,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1185175411 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1185175411 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1185175411 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1185175411 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1185175411| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite20_Out1185175411| ~x$r_buff1_thd3~0_In1185175411) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1185175411, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1185175411, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1185175411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1185175411} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1185175411|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1185175411, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1185175411, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1185175411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1185175411} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:26:32,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:26:32,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In684654837 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In684654837 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out684654837| ~x$r_buff0_thd1~0_In684654837) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out684654837| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In684654837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684654837} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In684654837, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out684654837|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684654837} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:26:32,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-327111166 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-327111166 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-327111166 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-327111166 256)))) (or (and (= ~x$r_buff1_thd1~0_In-327111166 |P0Thread1of1ForFork0_#t~ite8_Out-327111166|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-327111166|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-327111166, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-327111166, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-327111166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-327111166} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-327111166, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-327111166|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-327111166, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-327111166, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-327111166} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:26:32,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:26:32,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1752488373 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1752488373 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1752488373| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1752488373| ~x$w_buff0_used~0_In-1752488373)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1752488373, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1752488373} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1752488373|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1752488373, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1752488373} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:26:32,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-3445157 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-3445157 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-3445157 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-3445157 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-3445157| 0)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-3445157 |P1Thread1of1ForFork1_#t~ite12_Out-3445157|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-3445157, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-3445157, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-3445157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-3445157} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-3445157, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-3445157, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-3445157|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-3445157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-3445157} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:26:32,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1317471409 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1317471409 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1317471409)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1317471409 ~x$r_buff0_thd2~0_Out1317471409)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1317471409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1317471409} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1317471409|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1317471409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1317471409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:26:32,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1082164759 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1082164759 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1082164759 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1082164759 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1082164759| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In-1082164759 |P1Thread1of1ForFork1_#t~ite14_Out-1082164759|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1082164759, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1082164759, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1082164759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1082164759} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1082164759, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1082164759, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1082164759, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1082164759|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1082164759} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:26:32,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:26:32,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:26:32,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out956141338| |ULTIMATE.start_main_#t~ite24_Out956141338|)) (.cse1 (= (mod ~x$w_buff1_used~0_In956141338 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In956141338 256)))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In956141338 |ULTIMATE.start_main_#t~ite24_Out956141338|) (not .cse2)) (and .cse0 (= ~x~0_In956141338 |ULTIMATE.start_main_#t~ite24_Out956141338|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In956141338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In956141338, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In956141338, ~x~0=~x~0_In956141338} OutVars{~x$w_buff1~0=~x$w_buff1~0_In956141338, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out956141338|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out956141338|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In956141338, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In956141338, ~x~0=~x~0_In956141338} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:26:32,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1376716317 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1376716317 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1376716317|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1376716317 |ULTIMATE.start_main_#t~ite26_Out-1376716317|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376716317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376716317} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376716317, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1376716317|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376716317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:26:32,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2097990348 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2097990348 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In2097990348 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2097990348 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out2097990348|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In2097990348 |ULTIMATE.start_main_#t~ite27_Out2097990348|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2097990348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2097990348, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2097990348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2097990348} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2097990348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2097990348, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2097990348|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2097990348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2097990348} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:26:32,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-669264230 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-669264230 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-669264230| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-669264230| ~x$r_buff0_thd0~0_In-669264230)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-669264230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669264230} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-669264230, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-669264230|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669264230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:26:32,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-109701526 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-109701526 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-109701526 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-109701526 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-109701526| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-109701526| ~x$r_buff1_thd0~0_In-109701526) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-109701526, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109701526, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-109701526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-109701526} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-109701526, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-109701526|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109701526, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-109701526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-109701526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:26:32,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:26:32,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:26:32,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:26:32,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:26:32 BasicIcfg [2019-12-26 23:26:32,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:26:32,714 INFO L168 Benchmark]: Toolchain (without parser) took 91700.89 ms. Allocated memory was 143.7 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 98.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 988.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:26:32,715 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:26:32,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.75 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 98.0 MB in the beginning and 153.7 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:26:32,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.64 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 150.9 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:26:32,721 INFO L168 Benchmark]: Boogie Preprocessor took 38.84 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.2 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:26:32,721 INFO L168 Benchmark]: RCFGBuilder took 864.81 ms. Allocated memory is still 200.8 MB. Free memory was 148.2 MB in the beginning and 98.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:26:32,722 INFO L168 Benchmark]: TraceAbstraction took 89891.12 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 931.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:26:32,732 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.76 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.75 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 98.0 MB in the beginning and 153.7 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.64 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.84 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 864.81 ms. Allocated memory is still 200.8 MB. Free memory was 148.2 MB in the beginning and 98.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89891.12 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 931.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2469 SDtfs, 1901 SDslu, 4096 SDs, 0 SdLazy, 2326 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 83644 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 149841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...