/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:01:04,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:01:04,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:01:04,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:01:04,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:01:04,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:01:04,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:01:04,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:01:04,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:01:04,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:01:04,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:01:04,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:01:04,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:01:04,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:01:04,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:01:04,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:01:04,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:01:04,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:01:04,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:01:04,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:01:04,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:01:04,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:01:04,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:01:04,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:01:04,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:01:04,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:01:04,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:01:04,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:01:04,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:01:04,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:01:04,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:01:04,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:01:04,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:01:04,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:01:04,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:01:04,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:01:04,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:01:04,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:01:04,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:01:04,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:01:04,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:01:04,599 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.epf [2019-12-18 18:01:04,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:01:04,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:01:04,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:01:04,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:01:04,615 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:01:04,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:01:04,616 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:01:04,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:01:04,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:01:04,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:01:04,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:01:04,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:01:04,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:01:04,617 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:01:04,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:01:04,617 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:01:04,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:01:04,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:01:04,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:01:04,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:01:04,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:01:04,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:01:04,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:01:04,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:01:04,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:01:04,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:01:04,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:01:04,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:01:04,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:01:04,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:01:04,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:01:04,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:01:04,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:01:04,933 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:01:04,934 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-18 18:01:05,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a8c2daf/6769a5e86651410796873497ef5e6ea4/FLAG30fec1154 [2019-12-18 18:01:05,570 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:01:05,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-18 18:01:05,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a8c2daf/6769a5e86651410796873497ef5e6ea4/FLAG30fec1154 [2019-12-18 18:01:05,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a8c2daf/6769a5e86651410796873497ef5e6ea4 [2019-12-18 18:01:05,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:01:05,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:01:05,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:01:05,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:01:05,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:01:05,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:01:05" (1/1) ... [2019-12-18 18:01:05,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634104fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:05, skipping insertion in model container [2019-12-18 18:01:05,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:01:05" (1/1) ... [2019-12-18 18:01:05,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:01:05,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:01:06,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:01:06,499 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:01:06,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:01:06,638 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:01:06,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06 WrapperNode [2019-12-18 18:01:06,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:01:06,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:01:06,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:01:06,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:01:06,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:01:06,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:01:06,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:01:06,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:01:06,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (1/1) ... [2019-12-18 18:01:06,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:01:06,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:01:06,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:01:06,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:01:06,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (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-18 18:01:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:01:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:01:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:01:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:01:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:01:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:01:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:01:06,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:01:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:01:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:01:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:01:06,819 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:01:07,556 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:01:07,556 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:01:07,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:01:07 BoogieIcfgContainer [2019-12-18 18:01:07,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:01:07,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:01:07,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:01:07,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:01:07,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:01:05" (1/3) ... [2019-12-18 18:01:07,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cc261c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:01:07, skipping insertion in model container [2019-12-18 18:01:07,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:06" (2/3) ... [2019-12-18 18:01:07,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cc261c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:01:07, skipping insertion in model container [2019-12-18 18:01:07,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:01:07" (3/3) ... [2019-12-18 18:01:07,568 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2019-12-18 18:01:07,579 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:01:07,579 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:01:07,590 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:01:07,591 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:01:07,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,628 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,628 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,639 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,639 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,639 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:07,685 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:01:07,703 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:01:07,704 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:01:07,704 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:01:07,704 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:01:07,704 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:01:07,704 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:01:07,705 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:01:07,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:01:07,723 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 18:01:07,725 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:01:07,842 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:01:07,842 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:01:07,855 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:01:07,872 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:01:07,933 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:01:07,933 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:01:07,941 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:01:07,956 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 18:01:07,960 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:01:12,346 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 18:01:12,589 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:01:12,615 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-12-18 18:01:12,615 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 18:01:12,619 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-18 18:01:13,160 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-18 18:01:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-18 18:01:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:01:13,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:13,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:01:13,172 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-12-18 18:01:13,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:13,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691585126] [2019-12-18 18:01:13,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:13,440 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-18 18:01:13,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691585126] [2019-12-18 18:01:13,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:13,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:01:13,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169881433] [2019-12-18 18:01:13,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:13,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:13,466 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-18 18:01:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:13,747 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-18 18:01:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:13,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:01:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:13,904 INFO L225 Difference]: With dead ends: 9416 [2019-12-18 18:01:13,904 INFO L226 Difference]: Without dead ends: 9234 [2019-12-18 18:01:13,906 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-18 18:01:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-18 18:01:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-18 18:01:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-18 18:01:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-18 18:01:14,453 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-18 18:01:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:14,453 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-18 18:01:14,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-18 18:01:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:01:14,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:14,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:14,459 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-12-18 18:01:14,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:14,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6574369] [2019-12-18 18:01:14,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:14,604 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-18 18:01:14,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6574369] [2019-12-18 18:01:14,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:14,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:14,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908141907] [2019-12-18 18:01:14,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:14,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:14,608 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-18 18:01:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:15,067 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-18 18:01:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:01:15,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:01:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:15,157 INFO L225 Difference]: With dead ends: 14362 [2019-12-18 18:01:15,158 INFO L226 Difference]: Without dead ends: 14355 [2019-12-18 18:01:15,159 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-18 18:01:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-18 18:01:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-18 18:01:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-18 18:01:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-18 18:01:16,301 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-18 18:01:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:16,301 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-18 18:01:16,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-18 18:01:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:01:16,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:16,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:16,309 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-12-18 18:01:16,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:16,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82860096] [2019-12-18 18:01:16,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:01:16,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82860096] [2019-12-18 18:01:16,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:16,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:16,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888923559] [2019-12-18 18:01:16,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:16,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:16,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:16,393 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-18 18:01:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:16,412 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-18 18:01:16,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:16,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 18:01:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:16,418 INFO L225 Difference]: With dead ends: 1778 [2019-12-18 18:01:16,418 INFO L226 Difference]: Without dead ends: 1778 [2019-12-18 18:01:16,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-18 18:01:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-18 18:01:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-18 18:01:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-18 18:01:16,465 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-18 18:01:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:16,465 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-18 18:01:16,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-18 18:01:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 18:01:16,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:16,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:16,468 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-12-18 18:01:16,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:16,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17906847] [2019-12-18 18:01:16,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:16,535 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-18 18:01:16,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17906847] [2019-12-18 18:01:16,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:16,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:16,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080261772] [2019-12-18 18:01:16,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:16,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:16,541 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-12-18 18:01:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:16,568 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-18 18:01:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:01:16,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 18:01:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:16,571 INFO L225 Difference]: With dead ends: 371 [2019-12-18 18:01:16,571 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 18:01:16,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 18:01:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-18 18:01:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 18:01:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-18 18:01:16,583 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-18 18:01:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:16,584 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-18 18:01:16,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-18 18:01:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:16,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:16,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:16,587 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-12-18 18:01:16,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:16,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902221685] [2019-12-18 18:01:16,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:16,732 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-18 18:01:16,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902221685] [2019-12-18 18:01:16,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:16,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:16,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566726946] [2019-12-18 18:01:16,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:16,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:16,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:16,735 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-18 18:01:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:16,796 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-18 18:01:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:16,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:01:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:16,799 INFO L225 Difference]: With dead ends: 345 [2019-12-18 18:01:16,799 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 18:01:16,799 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-18 18:01:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 18:01:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 18:01:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 18:01:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-18 18:01:16,807 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-18 18:01:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:16,807 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-18 18:01:16,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-18 18:01:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:16,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:16,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:16,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-12-18 18:01:16,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:16,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304604199] [2019-12-18 18:01:16,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:16,994 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-18 18:01:16,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304604199] [2019-12-18 18:01:16,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:16,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:16,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17121194] [2019-12-18 18:01:16,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:16,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:16,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:16,997 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-18 18:01:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:17,045 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-18 18:01:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:17,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:01:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:17,047 INFO L225 Difference]: With dead ends: 345 [2019-12-18 18:01:17,047 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 18:01:17,047 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-18 18:01:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 18:01:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 18:01:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 18:01:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-18 18:01:17,056 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-18 18:01:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:17,058 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-18 18:01:17,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-18 18:01:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:17,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:17,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:17,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:17,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:17,060 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-12-18 18:01:17,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:17,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654141225] [2019-12-18 18:01:17,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:17,189 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-18 18:01:17,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654141225] [2019-12-18 18:01:17,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:17,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:17,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699580947] [2019-12-18 18:01:17,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:17,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:17,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:17,193 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 3 states. [2019-12-18 18:01:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:17,213 INFO L93 Difference]: Finished difference Result 328 states and 585 transitions. [2019-12-18 18:01:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:17,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:01:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:17,214 INFO L225 Difference]: With dead ends: 328 [2019-12-18 18:01:17,214 INFO L226 Difference]: Without dead ends: 328 [2019-12-18 18:01:17,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-18 18:01:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-12-18 18:01:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 18:01:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 585 transitions. [2019-12-18 18:01:17,231 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 585 transitions. Word has length 52 [2019-12-18 18:01:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:17,231 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 585 transitions. [2019-12-18 18:01:17,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 585 transitions. [2019-12-18 18:01:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:01:17,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:17,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:17,233 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1649755206, now seen corresponding path program 1 times [2019-12-18 18:01:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:17,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438743477] [2019-12-18 18:01:17,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:17,381 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-18 18:01:17,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438743477] [2019-12-18 18:01:17,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:17,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:01:17,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538027300] [2019-12-18 18:01:17,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:17,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:17,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:17,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:17,384 INFO L87 Difference]: Start difference. First operand 328 states and 585 transitions. Second operand 5 states. [2019-12-18 18:01:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:17,595 INFO L93 Difference]: Finished difference Result 459 states and 819 transitions. [2019-12-18 18:01:17,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:01:17,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 18:01:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:17,596 INFO L225 Difference]: With dead ends: 459 [2019-12-18 18:01:17,596 INFO L226 Difference]: Without dead ends: 459 [2019-12-18 18:01:17,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:01:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-18 18:01:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2019-12-18 18:01:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-18 18:01:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 652 transitions. [2019-12-18 18:01:17,607 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 652 transitions. Word has length 53 [2019-12-18 18:01:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:17,607 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 652 transitions. [2019-12-18 18:01:17,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 652 transitions. [2019-12-18 18:01:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:01:17,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:17,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:17,609 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:17,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1934699814, now seen corresponding path program 2 times [2019-12-18 18:01:17,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:17,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580326668] [2019-12-18 18:01:17,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:17,808 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-18 18:01:17,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580326668] [2019-12-18 18:01:17,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:17,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:17,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991064888] [2019-12-18 18:01:17,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:17,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:17,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:17,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:17,811 INFO L87 Difference]: Start difference. First operand 363 states and 652 transitions. Second operand 7 states. [2019-12-18 18:01:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:18,053 INFO L93 Difference]: Finished difference Result 502 states and 893 transitions. [2019-12-18 18:01:18,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:01:18,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 18:01:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:18,056 INFO L225 Difference]: With dead ends: 502 [2019-12-18 18:01:18,056 INFO L226 Difference]: Without dead ends: 502 [2019-12-18 18:01:18,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:01:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-18 18:01:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 377. [2019-12-18 18:01:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-18 18:01:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 678 transitions. [2019-12-18 18:01:18,065 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 678 transitions. Word has length 53 [2019-12-18 18:01:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:18,065 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 678 transitions. [2019-12-18 18:01:18,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 678 transitions. [2019-12-18 18:01:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:01:18,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:18,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:18,068 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:18,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:18,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1416640772, now seen corresponding path program 3 times [2019-12-18 18:01:18,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:18,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832513886] [2019-12-18 18:01:18,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:18,150 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-18 18:01:18,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832513886] [2019-12-18 18:01:18,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:18,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:18,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597123008] [2019-12-18 18:01:18,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:18,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:18,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:18,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:18,153 INFO L87 Difference]: Start difference. First operand 377 states and 678 transitions. Second operand 3 states. [2019-12-18 18:01:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:18,195 INFO L93 Difference]: Finished difference Result 376 states and 676 transitions. [2019-12-18 18:01:18,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:18,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:01:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:18,197 INFO L225 Difference]: With dead ends: 376 [2019-12-18 18:01:18,197 INFO L226 Difference]: Without dead ends: 376 [2019-12-18 18:01:18,198 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-18 18:01:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-18 18:01:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 273. [2019-12-18 18:01:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-18 18:01:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 489 transitions. [2019-12-18 18:01:18,204 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 489 transitions. Word has length 53 [2019-12-18 18:01:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:18,205 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 489 transitions. [2019-12-18 18:01:18,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 489 transitions. [2019-12-18 18:01:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:01:18,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:18,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:18,207 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash -69490417, now seen corresponding path program 1 times [2019-12-18 18:01:18,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:18,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754929776] [2019-12-18 18:01:18,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:18,358 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-18 18:01:18,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754929776] [2019-12-18 18:01:18,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:18,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:01:18,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257986174] [2019-12-18 18:01:18,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:01:18,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:01:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:01:18,360 INFO L87 Difference]: Start difference. First operand 273 states and 489 transitions. Second operand 6 states. [2019-12-18 18:01:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:18,435 INFO L93 Difference]: Finished difference Result 487 states and 865 transitions. [2019-12-18 18:01:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:01:18,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 18:01:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:18,437 INFO L225 Difference]: With dead ends: 487 [2019-12-18 18:01:18,437 INFO L226 Difference]: Without dead ends: 233 [2019-12-18 18:01:18,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:01:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-18 18:01:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-18 18:01:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 18:01:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 362 transitions. [2019-12-18 18:01:18,442 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 362 transitions. Word has length 54 [2019-12-18 18:01:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:18,443 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 362 transitions. [2019-12-18 18:01:18,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:01:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 362 transitions. [2019-12-18 18:01:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:01:18,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:18,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:18,444 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:18,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:18,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 2 times [2019-12-18 18:01:18,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:18,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732375986] [2019-12-18 18:01:18,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:01:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:01:18,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:01:18,585 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:01:18,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1587~0.base_19| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_19|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1587~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1587~0.base_19|) |v_ULTIMATE.start_main_~#t1587~0.offset_14| 0)) |v_#memory_int_17|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1587~0.base_19|) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= 0 |v_ULTIMATE.start_main_~#t1587~0.offset_14|) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= v_~x$flush_delayed~0_31 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_19| 1) |v_#valid_46|) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ULTIMATE.start_main_~#t1587~0.offset=|v_ULTIMATE.start_main_~#t1587~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_17|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_14|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ULTIMATE.start_main_~#t1587~0.base=|v_ULTIMATE.start_main_~#t1587~0.base_19|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1587~0.offset, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1588~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1587~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:01:18,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1588~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10|) |v_ULTIMATE.start_main_~#t1588~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1588~0.offset_9| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1588~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1588~0.base, #length] because there is no mapped edge [2019-12-18 18:01:18,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~y~0_Out-239796361 ~__unbuffered_p1_EBX~0_Out-239796361) (= ~__unbuffered_p1_EAX~0_Out-239796361 ~y~0_Out-239796361) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-239796361)) (= ~x$r_buff1_thd0~0_Out-239796361 ~x$r_buff0_thd0~0_In-239796361) (= ~x$r_buff0_thd1~0_In-239796361 ~x$r_buff1_thd1~0_Out-239796361) (= ~x$r_buff1_thd2~0_Out-239796361 ~x$r_buff0_thd2~0_In-239796361) (= ~x$r_buff0_thd2~0_Out-239796361 1) (= ~y~0_Out-239796361 1)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-239796361, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-239796361, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-239796361, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-239796361} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-239796361, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-239796361, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-239796361, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-239796361, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-239796361, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-239796361, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-239796361, ~y~0=~y~0_Out-239796361, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-239796361, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-239796361} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:01:18,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1384872452 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1384872452 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1384872452 |P0Thread1of1ForFork0_#t~ite3_Out1384872452|)) (and (or .cse1 .cse0) (= ~x~0_In1384872452 |P0Thread1of1ForFork0_#t~ite3_Out1384872452|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1384872452, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1384872452, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1384872452, ~x~0=~x~0_In1384872452} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1384872452|, ~x$w_buff1~0=~x$w_buff1~0_In1384872452, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1384872452, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1384872452, ~x~0=~x~0_In1384872452} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-18 18:01:18,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_16|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_16|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_15|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-18 18:01:18,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-515565015 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-515565015 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-515565015| ~x$w_buff0_used~0_In-515565015)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-515565015| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-515565015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-515565015} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-515565015|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-515565015, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-515565015} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:01:18,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1175764565 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1175764565 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1175764565 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1175764565 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1175764565| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out1175764565| ~x$w_buff1_used~0_In1175764565)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1175764565, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1175764565, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1175764565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175764565} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1175764565|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1175764565, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1175764565, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1175764565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1175764565} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:01:18,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1846857814 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1846857814 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1846857814|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-1846857814 |P0Thread1of1ForFork0_#t~ite7_Out-1846857814|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1846857814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1846857814} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1846857814, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1846857814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1846857814} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:01:18,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1193496601 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1193496601 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1193496601|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1193496601| ~x$w_buff0_used~0_In-1193496601) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1193496601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193496601} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1193496601|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1193496601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193496601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:01:18,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1933972286 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1933972286 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1933972286 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1933972286 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1933972286|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1933972286 |P1Thread1of1ForFork1_#t~ite12_Out-1933972286|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933972286, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1933972286, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1933972286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933972286} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933972286, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1933972286, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1933972286|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1933972286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933972286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:01:18,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1904603213 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1904603213 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1904603213 ~x$r_buff0_thd2~0_In1904603213)) (and (= ~x$r_buff0_thd2~0_Out1904603213 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1904603213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904603213} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1904603213|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1904603213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904603213} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:01:18,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-43931707 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-43931707 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-43931707 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-43931707 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-43931707 |P1Thread1of1ForFork1_#t~ite14_Out-43931707|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-43931707|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-43931707, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-43931707, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-43931707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-43931707} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-43931707, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-43931707, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-43931707, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-43931707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-43931707} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:01:18,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:01:18,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1396807118 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1396807118 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1396807118 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1396807118 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1396807118| ~x$r_buff1_thd1~0_In-1396807118) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1396807118|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1396807118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1396807118, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1396807118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1396807118} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1396807118, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1396807118|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1396807118, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1396807118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1396807118} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:01:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:01:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:01:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1685566468 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1685566468 256) 0))) (or (and (= ~x~0_In-1685566468 |ULTIMATE.start_main_#t~ite17_Out-1685566468|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-1685566468| ~x$w_buff1~0_In-1685566468)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1685566468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1685566468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1685566468, ~x~0=~x~0_In-1685566468} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1685566468|, ~x$w_buff1~0=~x$w_buff1~0_In-1685566468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1685566468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1685566468, ~x~0=~x~0_In-1685566468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 18:01:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 18:01:18,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1607610860 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1607610860 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1607610860| ~x$w_buff0_used~0_In-1607610860) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1607610860| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607610860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607610860} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607610860, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1607610860|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607610860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 18:01:18,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1608159577 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1608159577 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1608159577 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1608159577 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1608159577|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1608159577 |ULTIMATE.start_main_#t~ite20_Out-1608159577|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1608159577, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1608159577, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1608159577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1608159577} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1608159577, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1608159577, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1608159577|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1608159577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1608159577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 18:01:18,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1256877078 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1256877078 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1256877078| ~x$r_buff0_thd0~0_In-1256877078)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1256877078| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256877078, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256877078} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256877078, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1256877078|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256877078} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 18:01:18,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1844628134 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1844628134 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1844628134 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1844628134 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1844628134|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-1844628134| ~x$r_buff1_thd0~0_In-1844628134) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1844628134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1844628134, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1844628134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1844628134} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1844628134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1844628134, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1844628134, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1844628134|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1844628134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 18:01:18,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 18:01:18,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:01:18,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:01:18,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:01:18 BasicIcfg [2019-12-18 18:01:18,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:01:18,704 INFO L168 Benchmark]: Toolchain (without parser) took 12845.44 ms. Allocated memory was 136.3 MB in the beginning and 538.4 MB in the end (delta: 402.1 MB). Free memory was 100.1 MB in the beginning and 151.3 MB in the end (delta: -51.2 MB). Peak memory consumption was 350.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:18,707 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 18:01:18,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.72 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 155.5 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:18,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.46 ms. Allocated memory is still 200.8 MB. Free memory was 155.5 MB in the beginning and 152.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:18,712 INFO L168 Benchmark]: Boogie Preprocessor took 39.39 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:18,713 INFO L168 Benchmark]: RCFGBuilder took 810.36 ms. Allocated memory is still 200.8 MB. Free memory was 149.9 MB in the beginning and 105.3 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:18,714 INFO L168 Benchmark]: TraceAbstraction took 11142.34 ms. Allocated memory was 200.8 MB in the beginning and 538.4 MB in the end (delta: 337.6 MB). Free memory was 105.3 MB in the beginning and 151.3 MB in the end (delta: -46.0 MB). Peak memory consumption was 291.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:18,724 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.52 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.72 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 155.5 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.46 ms. Allocated memory is still 200.8 MB. Free memory was 155.5 MB in the beginning and 152.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.39 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.36 ms. Allocated memory is still 200.8 MB. Free memory was 149.9 MB in the beginning and 105.3 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11142.34 ms. Allocated memory was 200.8 MB in the beginning and 538.4 MB in the end (delta: 337.6 MB). Free memory was 105.3 MB in the beginning and 151.3 MB in the end (delta: -46.0 MB). Peak memory consumption was 291.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1092 SDtfs, 557 SDslu, 1405 SDs, 0 SdLazy, 649 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1708 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 54912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...