/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:03:21,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:03:21,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:03:21,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:03:21,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:03:21,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:03:21,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:03:21,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:03:21,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:03:21,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:03:21,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:03:21,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:03:21,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:03:21,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:03:21,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:03:21,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:03:21,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:03:21,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:03:21,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:03:21,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:03:21,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:03:21,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:03:21,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:03:21,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:03:21,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:03:21,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:03:21,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:03:21,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:03:21,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:03:21,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:03:21,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:03:21,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:03:21,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:03:21,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:03:21,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:03:21,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:03:21,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:03:21,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:03:21,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:03:21,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:03:21,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:03:21,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:03:21,797 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:03:21,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:03:21,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:03:21,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:03:21,799 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:03:21,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:03:21,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:03:21,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:03:21,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:03:21,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:03:21,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:03:21,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:03:21,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:03:21,801 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:03:21,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:03:21,801 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:03:21,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:03:21,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:03:21,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:03:21,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:03:21,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:03:21,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:03:21,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:03:21,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:03:21,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:03:21,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:03:21,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:03:21,804 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:03:21,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:03:21,804 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:03:21,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:03:22,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:03:22,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:03:22,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:03:22,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:03:22,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:03:22,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-27 17:03:22,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af63559b/ad3cf13c3ae6418785d2071f07ac3939/FLAG043cb2ba0 [2019-12-27 17:03:22,817 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:03:22,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-27 17:03:22,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af63559b/ad3cf13c3ae6418785d2071f07ac3939/FLAG043cb2ba0 [2019-12-27 17:03:23,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af63559b/ad3cf13c3ae6418785d2071f07ac3939 [2019-12-27 17:03:23,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:03:23,028 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:03:23,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:03:23,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:03:23,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:03:23,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403afd97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23, skipping insertion in model container [2019-12-27 17:03:23,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:03:23,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:03:23,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:03:23,635 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:03:23,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:03:23,802 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:03:23,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23 WrapperNode [2019-12-27 17:03:23,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:03:23,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:03:23,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:03:23,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:03:23,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:03:23,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:03:23,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:03:23,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:03:23,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... [2019-12-27 17:03:23,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:03:23,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:03:23,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:03:23,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:03:23,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:03:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:03:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:03:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:03:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:03:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:03:23,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:03:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:03:23,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:03:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:03:23,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:03:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:03:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:03:23,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:03:24,001 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:03:24,746 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:03:24,746 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:03:24,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:24 BoogieIcfgContainer [2019-12-27 17:03:24,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:03:24,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:03:24,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:03:24,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:03:24,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:03:23" (1/3) ... [2019-12-27 17:03:24,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c2f4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:24, skipping insertion in model container [2019-12-27 17:03:24,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:23" (2/3) ... [2019-12-27 17:03:24,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c2f4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:24, skipping insertion in model container [2019-12-27 17:03:24,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:24" (3/3) ... [2019-12-27 17:03:24,757 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2019-12-27 17:03:24,768 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:03:24,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:03:24,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:03:24,778 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:03:24,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,830 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,830 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,864 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,866 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,867 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:03:24,885 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:03:24,904 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:03:24,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:03:24,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:03:24,904 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:03:24,905 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:03:24,905 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:03:24,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:03:24,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:03:24,923 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 17:03:24,925 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 17:03:25,025 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 17:03:25,025 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:03:25,038 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:03:25,056 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 17:03:25,124 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 17:03:25,124 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:03:25,133 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:03:25,150 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 17:03:25,151 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:03:30,166 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 17:03:30,304 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 17:03:30,324 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-27 17:03:30,324 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 17:03:30,328 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-27 17:03:31,320 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 17:03:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 17:03:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 17:03:31,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:31,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:31,330 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 17:03:31,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:31,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107094236] [2019-12-27 17:03:31,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:31,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107094236] [2019-12-27 17:03:31,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:31,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:03:31,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406625064] [2019-12-27 17:03:31,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:31,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:31,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 17:03:31,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:31,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:31,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:31,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:31,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:31,742 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 17:03:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:32,021 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-27 17:03:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:32,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 17:03:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:32,190 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 17:03:32,191 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 17:03:32,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 17:03:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 17:03:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 17:03:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-27 17:03:33,260 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-27 17:03:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:33,262 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-27 17:03:33,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-27 17:03:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:03:33,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:33,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:33,276 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:33,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:33,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 17:03:33,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:33,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765794091] [2019-12-27 17:03:33,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:33,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765794091] [2019-12-27 17:03:33,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:33,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:33,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918700139] [2019-12-27 17:03:33,426 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:33,427 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:33,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:03:33,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:33,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:33,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:03:33,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:03:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:03:33,435 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-27 17:03:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:34,528 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-27 17:03:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:34,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 17:03:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:34,604 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 17:03:34,605 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 17:03:34,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 17:03:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 17:03:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 17:03:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-27 17:03:35,393 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-27 17:03:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:35,394 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-27 17:03:35,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:03:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-27 17:03:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:03:35,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:35,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:35,397 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 17:03:35,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:35,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824436759] [2019-12-27 17:03:35,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:35,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824436759] [2019-12-27 17:03:35,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:35,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:35,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201421594] [2019-12-27 17:03:35,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:35,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:35,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 17:03:35,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:35,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:03:35,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:35,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:35,516 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 5 states. [2019-12-27 17:03:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:35,929 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-27 17:03:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:35,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 17:03:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:36,031 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 17:03:36,032 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 17:03:36,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 17:03:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-27 17:03:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-27 17:03:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-27 17:03:37,843 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-27 17:03:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:37,843 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-27 17:03:37,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-27 17:03:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 17:03:37,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:37,854 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-27 17:03:37,854 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 17:03:37,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:37,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460169237] [2019-12-27 17:03:37,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:37,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460169237] [2019-12-27 17:03:37,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:37,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:37,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254017020] [2019-12-27 17:03:37,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:37,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:37,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 24 transitions. [2019-12-27 17:03:37,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:37,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:37,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:37,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:37,981 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-27 17:03:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:38,816 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-27 17:03:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:03:38,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 17:03:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:38,903 INFO L225 Difference]: With dead ends: 30132 [2019-12-27 17:03:38,904 INFO L226 Difference]: Without dead ends: 30118 [2019-12-27 17:03:38,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-27 17:03:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-27 17:03:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-27 17:03:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-27 17:03:39,861 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-27 17:03:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:39,862 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-27 17:03:39,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-27 17:03:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:03:39,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:39,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:39,890 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-27 17:03:39,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:39,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305069980] [2019-12-27 17:03:39,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:39,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305069980] [2019-12-27 17:03:39,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:39,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:03:39,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014602702] [2019-12-27 17:03:39,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:39,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:39,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:03:39,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:39,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:39,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:03:39,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:40,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:03:40,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:40,000 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 6 states. [2019-12-27 17:03:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:40,508 INFO L93 Difference]: Finished difference Result 32606 states and 115328 transitions. [2019-12-27 17:03:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:03:40,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:03:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:40,570 INFO L225 Difference]: With dead ends: 32606 [2019-12-27 17:03:40,571 INFO L226 Difference]: Without dead ends: 32574 [2019-12-27 17:03:40,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32574 states. [2019-12-27 17:03:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32574 to 28036. [2019-12-27 17:03:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28036 states. [2019-12-27 17:03:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28036 states to 28036 states and 100001 transitions. [2019-12-27 17:03:42,506 INFO L78 Accepts]: Start accepts. Automaton has 28036 states and 100001 transitions. Word has length 27 [2019-12-27 17:03:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:42,507 INFO L462 AbstractCegarLoop]: Abstraction has 28036 states and 100001 transitions. [2019-12-27 17:03:42,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:03:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 28036 states and 100001 transitions. [2019-12-27 17:03:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:03:42,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:42,538 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] [2019-12-27 17:03:42,539 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1188296037, now seen corresponding path program 1 times [2019-12-27 17:03:42,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:42,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618969477] [2019-12-27 17:03:42,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:42,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618969477] [2019-12-27 17:03:42,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:42,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:42,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1835103957] [2019-12-27 17:03:42,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:42,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:42,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 35 transitions. [2019-12-27 17:03:42,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:42,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:42,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:42,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:42,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:42,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:42,609 INFO L87 Difference]: Start difference. First operand 28036 states and 100001 transitions. Second operand 3 states. [2019-12-27 17:03:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:42,794 INFO L93 Difference]: Finished difference Result 35568 states and 127677 transitions. [2019-12-27 17:03:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:42,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 17:03:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:42,865 INFO L225 Difference]: With dead ends: 35568 [2019-12-27 17:03:42,866 INFO L226 Difference]: Without dead ends: 35568 [2019-12-27 17:03:42,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35568 states. [2019-12-27 17:03:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35568 to 31188. [2019-12-27 17:03:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31188 states. [2019-12-27 17:03:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31188 states to 31188 states and 112337 transitions. [2019-12-27 17:03:43,819 INFO L78 Accepts]: Start accepts. Automaton has 31188 states and 112337 transitions. Word has length 33 [2019-12-27 17:03:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:43,820 INFO L462 AbstractCegarLoop]: Abstraction has 31188 states and 112337 transitions. [2019-12-27 17:03:43,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 31188 states and 112337 transitions. [2019-12-27 17:03:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:03:43,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:43,851 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] [2019-12-27 17:03:43,851 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1536973783, now seen corresponding path program 1 times [2019-12-27 17:03:43,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:43,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326940037] [2019-12-27 17:03:43,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:43,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326940037] [2019-12-27 17:03:43,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:43,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:43,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691959220] [2019-12-27 17:03:43,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:43,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:43,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 35 transitions. [2019-12-27 17:03:43,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:43,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:03:43,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:03:43,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:03:43,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:03:43,952 INFO L87 Difference]: Start difference. First operand 31188 states and 112337 transitions. Second operand 4 states. [2019-12-27 17:03:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:44,352 INFO L93 Difference]: Finished difference Result 18039 states and 56038 transitions. [2019-12-27 17:03:44,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:03:44,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 17:03:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:44,377 INFO L225 Difference]: With dead ends: 18039 [2019-12-27 17:03:44,377 INFO L226 Difference]: Without dead ends: 17509 [2019-12-27 17:03:44,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2019-12-27 17:03:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 17509. [2019-12-27 17:03:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-27 17:03:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54532 transitions. [2019-12-27 17:03:44,642 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54532 transitions. Word has length 33 [2019-12-27 17:03:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:44,642 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54532 transitions. [2019-12-27 17:03:44,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:03:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54532 transitions. [2019-12-27 17:03:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:44,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:44,657 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] [2019-12-27 17:03:44,657 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:44,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash 345963664, now seen corresponding path program 1 times [2019-12-27 17:03:44,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:44,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943436412] [2019-12-27 17:03:44,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:44,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-27 17:03:44,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943436412] [2019-12-27 17:03:44,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:44,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:44,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484204658] [2019-12-27 17:03:44,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:44,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:44,735 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 46 transitions. [2019-12-27 17:03:44,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:44,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:44,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:44,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:44,737 INFO L87 Difference]: Start difference. First operand 17509 states and 54532 transitions. Second operand 3 states. [2019-12-27 17:03:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:44,841 INFO L93 Difference]: Finished difference Result 17509 states and 54339 transitions. [2019-12-27 17:03:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:44,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-27 17:03:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:44,865 INFO L225 Difference]: With dead ends: 17509 [2019-12-27 17:03:44,866 INFO L226 Difference]: Without dead ends: 17509 [2019-12-27 17:03:44,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2019-12-27 17:03:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 17509. [2019-12-27 17:03:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-27 17:03:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54339 transitions. [2019-12-27 17:03:45,131 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54339 transitions. Word has length 34 [2019-12-27 17:03:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:45,131 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54339 transitions. [2019-12-27 17:03:45,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54339 transitions. [2019-12-27 17:03:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:45,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:45,144 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] [2019-12-27 17:03:45,144 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1096312539, now seen corresponding path program 1 times [2019-12-27 17:03:45,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:45,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097462033] [2019-12-27 17:03:45,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:45,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097462033] [2019-12-27 17:03:45,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:45,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:45,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563551919] [2019-12-27 17:03:45,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:45,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:45,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 56 transitions. [2019-12-27 17:03:45,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:45,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:45,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:03:45,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:03:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:45,507 INFO L87 Difference]: Start difference. First operand 17509 states and 54339 transitions. Second operand 7 states. [2019-12-27 17:03:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:46,442 INFO L93 Difference]: Finished difference Result 23341 states and 70914 transitions. [2019-12-27 17:03:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 17:03:46,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 17:03:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:46,476 INFO L225 Difference]: With dead ends: 23341 [2019-12-27 17:03:46,477 INFO L226 Difference]: Without dead ends: 23313 [2019-12-27 17:03:46,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:03:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23313 states. [2019-12-27 17:03:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23313 to 15958. [2019-12-27 17:03:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15958 states. [2019-12-27 17:03:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 49857 transitions. [2019-12-27 17:03:46,793 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 49857 transitions. Word has length 34 [2019-12-27 17:03:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:46,793 INFO L462 AbstractCegarLoop]: Abstraction has 15958 states and 49857 transitions. [2019-12-27 17:03:46,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:03:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 49857 transitions. [2019-12-27 17:03:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:46,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:46,806 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] [2019-12-27 17:03:46,806 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:46,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash -308537285, now seen corresponding path program 1 times [2019-12-27 17:03:46,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:46,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833586136] [2019-12-27 17:03:46,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:46,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833586136] [2019-12-27 17:03:46,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:46,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:03:46,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [212716854] [2019-12-27 17:03:46,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:46,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:46,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 42 transitions. [2019-12-27 17:03:46,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:46,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:03:46,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:03:46,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:46,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:03:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:46,926 INFO L87 Difference]: Start difference. First operand 15958 states and 49857 transitions. Second operand 6 states. [2019-12-27 17:03:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:46,979 INFO L93 Difference]: Finished difference Result 2712 states and 6343 transitions. [2019-12-27 17:03:46,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:46,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 17:03:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:46,982 INFO L225 Difference]: With dead ends: 2712 [2019-12-27 17:03:46,982 INFO L226 Difference]: Without dead ends: 2403 [2019-12-27 17:03:46,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:03:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-12-27 17:03:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2019-12-27 17:03:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-27 17:03:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5482 transitions. [2019-12-27 17:03:47,005 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5482 transitions. Word has length 34 [2019-12-27 17:03:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:47,005 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5482 transitions. [2019-12-27 17:03:47,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:03:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5482 transitions. [2019-12-27 17:03:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 17:03:47,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:47,009 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] [2019-12-27 17:03:47,009 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-27 17:03:47,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:47,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791770149] [2019-12-27 17:03:47,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:47,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791770149] [2019-12-27 17:03:47,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:47,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:47,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1018956531] [2019-12-27 17:03:47,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:47,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:47,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 55 transitions. [2019-12-27 17:03:47,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:47,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:03:47,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:03:47,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:47,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:03:47,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:47,191 INFO L87 Difference]: Start difference. First operand 2403 states and 5482 transitions. Second operand 7 states. [2019-12-27 17:03:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:47,266 INFO L93 Difference]: Finished difference Result 708 states and 1600 transitions. [2019-12-27 17:03:47,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:03:47,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 17:03:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:47,268 INFO L225 Difference]: With dead ends: 708 [2019-12-27 17:03:47,268 INFO L226 Difference]: Without dead ends: 662 [2019-12-27 17:03:47,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:03:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-27 17:03:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 606. [2019-12-27 17:03:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-27 17:03:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1378 transitions. [2019-12-27 17:03:47,278 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1378 transitions. Word has length 45 [2019-12-27 17:03:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:47,278 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1378 transitions. [2019-12-27 17:03:47,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:03:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1378 transitions. [2019-12-27 17:03:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:03:47,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:47,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:47,281 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1345831558, now seen corresponding path program 1 times [2019-12-27 17:03:47,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:47,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676143630] [2019-12-27 17:03:47,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:47,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676143630] [2019-12-27 17:03:47,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:47,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:47,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192079591] [2019-12-27 17:03:47,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:47,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:47,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 134 transitions. [2019-12-27 17:03:47,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:47,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:03:47,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:47,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:47,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:47,486 INFO L87 Difference]: Start difference. First operand 606 states and 1378 transitions. Second operand 5 states. [2019-12-27 17:03:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:47,666 INFO L93 Difference]: Finished difference Result 877 states and 2007 transitions. [2019-12-27 17:03:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:03:47,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 17:03:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:47,668 INFO L225 Difference]: With dead ends: 877 [2019-12-27 17:03:47,668 INFO L226 Difference]: Without dead ends: 877 [2019-12-27 17:03:47,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-27 17:03:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 642. [2019-12-27 17:03:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-27 17:03:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-27 17:03:47,679 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 56 [2019-12-27 17:03:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:47,680 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-27 17:03:47,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-27 17:03:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:03:47,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:47,681 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] [2019-12-27 17:03:47,682 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 2 times [2019-12-27 17:03:47,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:47,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141357313] [2019-12-27 17:03:47,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:47,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141357313] [2019-12-27 17:03:47,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:47,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:47,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423567969] [2019-12-27 17:03:47,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:47,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:47,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 129 transitions. [2019-12-27 17:03:47,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:47,881 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:03:47,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:47,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:47,882 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 5 states. [2019-12-27 17:03:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:48,040 INFO L93 Difference]: Finished difference Result 822 states and 1829 transitions. [2019-12-27 17:03:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:03:48,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 17:03:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:48,042 INFO L225 Difference]: With dead ends: 822 [2019-12-27 17:03:48,042 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 17:03:48,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 17:03:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 606. [2019-12-27 17:03:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-27 17:03:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-27 17:03:48,053 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-27 17:03:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:48,053 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-27 17:03:48,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-27 17:03:48,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:03:48,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:48,054 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] [2019-12-27 17:03:48,054 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:48,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-27 17:03:48,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:48,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350089728] [2019-12-27 17:03:48,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:48,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350089728] [2019-12-27 17:03:48,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:48,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:03:48,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314215880] [2019-12-27 17:03:48,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:48,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:48,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 132 transitions. [2019-12-27 17:03:48,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:48,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:03:48,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:03:48,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:03:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:03:48,327 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 8 states. [2019-12-27 17:03:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:48,469 INFO L93 Difference]: Finished difference Result 960 states and 2014 transitions. [2019-12-27 17:03:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:03:48,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 17:03:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:48,471 INFO L225 Difference]: With dead ends: 960 [2019-12-27 17:03:48,471 INFO L226 Difference]: Without dead ends: 610 [2019-12-27 17:03:48,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:03:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-27 17:03:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-27 17:03:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-27 17:03:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-27 17:03:48,482 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-27 17:03:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:48,483 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-27 17:03:48,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:03:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-27 17:03:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:03:48,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:48,485 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] [2019-12-27 17:03:48,485 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-27 17:03:48,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:48,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803736063] [2019-12-27 17:03:48,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:48,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803736063] [2019-12-27 17:03:48,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:48,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:03:48,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [510569834] [2019-12-27 17:03:48,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:48,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:48,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 17:03:48,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:48,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:03:48,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:03:48,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:48,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:03:48,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:03:48,911 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 12 states. [2019-12-27 17:03:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:49,338 INFO L93 Difference]: Finished difference Result 852 states and 1845 transitions. [2019-12-27 17:03:49,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:03:49,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 17:03:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:49,341 INFO L225 Difference]: With dead ends: 852 [2019-12-27 17:03:49,341 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 17:03:49,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:03:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 17:03:49,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 748. [2019-12-27 17:03:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-27 17:03:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1628 transitions. [2019-12-27 17:03:49,353 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1628 transitions. Word has length 57 [2019-12-27 17:03:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:49,354 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1628 transitions. [2019-12-27 17:03:49,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:03:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1628 transitions. [2019-12-27 17:03:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:03:49,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:49,355 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] [2019-12-27 17:03:49,355 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-27 17:03:49,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:49,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784402022] [2019-12-27 17:03:49,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:03:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:03:49,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:03:49,470 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:03:49,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27| 1) |v_#valid_54|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1126~0.base_27| 4) |v_#length_19|) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27|) |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$r_buff0_thd1~0_41 0) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= (select .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1126~0.base_27|) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_~#t1126~0.offset=|v_ULTIMATE.start_main_~#t1126~0.offset_21|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1126~0.base=|v_ULTIMATE.start_main_~#t1126~0.base_27|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1127~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1127~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1126~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1128~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_~#t1126~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1128~0.offset, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:03:49,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1127~0.base_9| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1127~0.base_9|) (= |v_ULTIMATE.start_main_~#t1127~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9|) |v_ULTIMATE.start_main_~#t1127~0.offset_8| 1)))) 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_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1127~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1127~0.offset] because there is no mapped edge [2019-12-27 17:03:49,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1128~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1128~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1128~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10|) |v_ULTIMATE.start_main_~#t1128~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1128~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_10|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1128~0.base, ULTIMATE.start_main_~#t1128~0.offset] because there is no mapped edge [2019-12-27 17:03:49,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~y$r_buff0_thd3~0_In-1046068251 ~y$r_buff1_thd3~0_Out-1046068251) (= ~y$r_buff1_thd0~0_Out-1046068251 ~y$r_buff0_thd0~0_In-1046068251) (= ~z~0_Out-1046068251 ~__unbuffered_p2_EAX~0_Out-1046068251) (= ~a~0_In-1046068251 ~__unbuffered_p2_EBX~0_Out-1046068251) (= ~y$r_buff0_thd1~0_In-1046068251 ~y$r_buff1_thd1~0_Out-1046068251) (= ~y$r_buff0_thd3~0_Out-1046068251 1) (= ~z~0_Out-1046068251 1) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1046068251 0)) (= ~y$r_buff1_thd2~0_Out-1046068251 ~y$r_buff0_thd2~0_In-1046068251)) InVars {~a~0=~a~0_In-1046068251, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1046068251, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1046068251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1046068251, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1046068251, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1046068251} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1046068251, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1046068251, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1046068251, ~a~0=~a~0_In-1046068251, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1046068251, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1046068251, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1046068251, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1046068251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1046068251, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1046068251, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1046068251, ~z~0=~z~0_Out-1046068251, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1046068251} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:03:49,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 17:03:49,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1773809150 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1773809150| |P1Thread1of1ForFork0_#t~ite4_Out-1773809150|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1773809150 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1773809150| ~y~0_In-1773809150) (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out-1773809150| ~y$w_buff1~0_In-1773809150) (not .cse1) .cse0 (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1773809150, ~y$w_buff1~0=~y$w_buff1~0_In-1773809150, ~y~0=~y~0_In-1773809150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773809150} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1773809150, ~y$w_buff1~0=~y$w_buff1~0_In-1773809150, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1773809150|, ~y~0=~y~0_In-1773809150, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1773809150|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773809150} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:03:49,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In817294851 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In817294851 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite11_Out817294851|) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out817294851| ~y$w_buff0_used~0_In817294851) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In817294851, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In817294851} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In817294851, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out817294851|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In817294851} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:03:49,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In711278174 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In711278174 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In711278174 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In711278174 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite12_Out711278174| ~y$w_buff1_used~0_In711278174) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out711278174|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In711278174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In711278174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In711278174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In711278174} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In711278174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In711278174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In711278174, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out711278174|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In711278174} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:03:49,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-653413005 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-653413005 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-653413005 ~y$r_buff0_thd3~0_Out-653413005) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-653413005) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-653413005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-653413005} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-653413005|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-653413005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-653413005} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 17:03:49,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1120882078 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1120882078 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1120882078 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1120882078 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out-1120882078|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-1120882078 |P2Thread1of1ForFork1_#t~ite14_Out-1120882078|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1120882078, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120882078, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1120882078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1120882078} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1120882078|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1120882078, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120882078, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1120882078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1120882078} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:03:49,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 17:03:49,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-9248027 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-9248027 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite5_Out-9248027| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite5_Out-9248027| ~y$w_buff0_used~0_In-9248027) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-9248027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-9248027} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-9248027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-9248027, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-9248027|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:03:49,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-715096114 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-715096114 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-715096114 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-715096114 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite6_Out-715096114| ~y$w_buff1_used~0_In-715096114) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite6_Out-715096114| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-715096114, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-715096114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-715096114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-715096114} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-715096114, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-715096114, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-715096114, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-715096114|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-715096114} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:03:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1455773317 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1455773317 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out1455773317| ~y$r_buff0_thd2~0_In1455773317) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite7_Out1455773317| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1455773317, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1455773317} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1455773317, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1455773317, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1455773317|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:03:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1190050604 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1190050604 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1190050604 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1190050604 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite8_Out1190050604| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In1190050604 |P1Thread1of1ForFork0_#t~ite8_Out1190050604|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1190050604, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1190050604, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1190050604, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1190050604} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1190050604, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1190050604, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1190050604, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out1190050604|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1190050604} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:03:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 17:03:49,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:03:49,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1220318898 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1220318898 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1220318898| |ULTIMATE.start_main_#t~ite19_Out1220318898|))) (or (and (= ~y$w_buff1~0_In1220318898 |ULTIMATE.start_main_#t~ite18_Out1220318898|) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite18_Out1220318898| ~y~0_In1220318898) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1220318898, ~y~0=~y~0_In1220318898, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220318898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220318898} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1220318898, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1220318898|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1220318898|, ~y~0=~y~0_In1220318898, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220318898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220318898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:03:49,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1806988075 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1806988075 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1806988075| ~y$w_buff0_used~0_In1806988075) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out1806988075| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1806988075, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806988075} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1806988075, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806988075, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1806988075|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:03:49,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1401818109 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1401818109 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1401818109 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1401818109 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1401818109| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1401818109 |ULTIMATE.start_main_#t~ite21_Out-1401818109|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1401818109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1401818109, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1401818109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1401818109} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1401818109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1401818109, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1401818109|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1401818109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1401818109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:03:49,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2108936903 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2108936903 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-2108936903|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-2108936903 |ULTIMATE.start_main_#t~ite22_Out-2108936903|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2108936903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2108936903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2108936903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2108936903, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2108936903|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:03:49,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1012124200 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1012124200 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1012124200 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1012124200 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out1012124200| ~y$r_buff1_thd0~0_In1012124200) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite23_Out1012124200| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1012124200, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1012124200, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1012124200, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1012124200} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1012124200, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1012124200, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1012124200, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1012124200|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1012124200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:03:49,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1169969582 256)))) (or (and (= ~y$w_buff0~0_In-1169969582 |ULTIMATE.start_main_#t~ite29_Out-1169969582|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1169969582 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-1169969582 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1169969582 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1169969582 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite29_Out-1169969582| |ULTIMATE.start_main_#t~ite30_Out-1169969582|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite29_In-1169969582| |ULTIMATE.start_main_#t~ite29_Out-1169969582|) (= ~y$w_buff0~0_In-1169969582 |ULTIMATE.start_main_#t~ite30_Out-1169969582|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1169969582, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1169969582|, ~y$w_buff0~0=~y$w_buff0~0_In-1169969582, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1169969582, ~weak$$choice2~0=~weak$$choice2~0_In-1169969582, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1169969582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1169969582} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1169969582|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1169969582, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1169969582|, ~y$w_buff0~0=~y$w_buff0~0_In-1169969582, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1169969582, ~weak$$choice2~0=~weak$$choice2~0_In-1169969582, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1169969582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1169969582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 17:03:49,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1562454577 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out1562454577| |ULTIMATE.start_main_#t~ite35_Out1562454577|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1562454577 256)))) (or (= (mod ~y$w_buff0_used~0_In1562454577 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1562454577 256) 0)) (and (= (mod ~y$w_buff1_used~0_In1562454577 256) 0) .cse1))) (= ~y$w_buff0_used~0_In1562454577 |ULTIMATE.start_main_#t~ite35_Out1562454577|)) (and (= |ULTIMATE.start_main_#t~ite35_In1562454577| |ULTIMATE.start_main_#t~ite35_Out1562454577|) (= |ULTIMATE.start_main_#t~ite36_Out1562454577| ~y$w_buff0_used~0_In1562454577) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1562454577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1562454577, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1562454577|, ~weak$$choice2~0=~weak$$choice2~0_In1562454577, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1562454577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1562454577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1562454577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1562454577, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1562454577|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1562454577|, ~weak$$choice2~0=~weak$$choice2~0_In1562454577, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1562454577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1562454577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 17:03:49,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-648307878 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In-648307878| |ULTIMATE.start_main_#t~ite38_Out-648307878|) (= |ULTIMATE.start_main_#t~ite39_Out-648307878| ~y$w_buff1_used~0_In-648307878)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-648307878 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-648307878 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-648307878 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-648307878 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-648307878| |ULTIMATE.start_main_#t~ite39_Out-648307878|) .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-648307878| ~y$w_buff1_used~0_In-648307878)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-648307878, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-648307878, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-648307878|, ~weak$$choice2~0=~weak$$choice2~0_In-648307878, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-648307878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-648307878} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-648307878, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-648307878|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-648307878, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-648307878|, ~weak$$choice2~0=~weak$$choice2~0_In-648307878, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-648307878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-648307878} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:03:49,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:03:49,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1512307621 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1512307621| ~y$r_buff1_thd0~0_In1512307621) (= |ULTIMATE.start_main_#t~ite44_In1512307621| |ULTIMATE.start_main_#t~ite44_Out1512307621|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1512307621 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1512307621 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1512307621 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1512307621 256))))) (= |ULTIMATE.start_main_#t~ite44_Out1512307621| |ULTIMATE.start_main_#t~ite45_Out1512307621|) (= |ULTIMATE.start_main_#t~ite44_Out1512307621| ~y$r_buff1_thd0~0_In1512307621)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1512307621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1512307621, ~weak$$choice2~0=~weak$$choice2~0_In1512307621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1512307621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1512307621, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1512307621|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1512307621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1512307621, ~weak$$choice2~0=~weak$$choice2~0_In1512307621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1512307621, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1512307621|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1512307621|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1512307621} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:03:49,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:03:49,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:03:49,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:03:49 BasicIcfg [2019-12-27 17:03:49,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:03:49,566 INFO L168 Benchmark]: Toolchain (without parser) took 26538.06 ms. Allocated memory was 139.5 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 101.4 MB in the beginning and 906.6 MB in the end (delta: -805.2 MB). Peak memory consumption was 357.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:03:49,566 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 17:03:49,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.58 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 100.9 MB in the beginning and 158.5 MB in the end (delta: -57.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:03:49,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.61 ms. Allocated memory is still 205.0 MB. Free memory was 158.5 MB in the beginning and 155.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:03:49,569 INFO L168 Benchmark]: Boogie Preprocessor took 37.48 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 152.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:03:49,569 INFO L168 Benchmark]: RCFGBuilder took 835.56 ms. Allocated memory is still 205.0 MB. Free memory was 152.8 MB in the beginning and 106.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:03:49,570 INFO L168 Benchmark]: TraceAbstraction took 24814.58 ms. Allocated memory was 205.0 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 105.6 MB in the beginning and 906.6 MB in the end (delta: -801.1 MB). Peak memory consumption was 295.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:03:49,574 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.19 ms. Allocated memory is still 139.5 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.58 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 100.9 MB in the beginning and 158.5 MB in the end (delta: -57.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.61 ms. Allocated memory is still 205.0 MB. Free memory was 158.5 MB in the beginning and 155.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.48 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 152.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.56 ms. Allocated memory is still 205.0 MB. Free memory was 152.8 MB in the beginning and 106.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24814.58 ms. Allocated memory was 205.0 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 105.6 MB in the beginning and 906.6 MB in the end (delta: -801.1 MB). Peak memory consumption was 295.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1784 SDtfs, 1966 SDslu, 3950 SDs, 0 SdLazy, 2075 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 30 SyntacticMatches, 19 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31188occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 29644 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 503 ConstructedInterpolants, 0 QuantifiedInterpolants, 69147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...