/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:09:00,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:09:00,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:09:00,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:09:00,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:09:00,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:09:00,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:09:00,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:09:00,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:09:00,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:09:00,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:09:00,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:09:00,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:09:00,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:09:00,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:09:00,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:09:00,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:09:00,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:09:00,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:09:00,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:09:00,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:09:00,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:09:00,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:09:00,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:09:00,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:09:00,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:09:00,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:09:00,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:09:00,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:09:00,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:09:00,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:09:00,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:09:00,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:09:00,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:09:00,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:09:00,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:09:00,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:09:00,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:09:00,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:09:00,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:09:00,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:09:00,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:09:00,595 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:09:00,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:09:00,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:09:00,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:09:00,599 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:09:00,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:09:00,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:09:00,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:09:00,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:09:00,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:09:00,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:09:00,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:09:00,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:09:00,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:09:00,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:09:00,603 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:09:00,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:09:00,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:09:00,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:09:00,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:09:00,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:09:00,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:00,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:09:00,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:09:00,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:09:00,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:09:00,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:09:00,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:09:00,607 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:09:00,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:09:00,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:09:00,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:09:00,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:09:00,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:09:00,904 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:09:00,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2019-12-18 15:09:00,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598c35a09/05d06fc7886d4d79a61c2e2c51f6c13d/FLAG5716143ff [2019-12-18 15:09:01,544 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:09:01,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2019-12-18 15:09:01,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598c35a09/05d06fc7886d4d79a61c2e2c51f6c13d/FLAG5716143ff [2019-12-18 15:09:01,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598c35a09/05d06fc7886d4d79a61c2e2c51f6c13d [2019-12-18 15:09:01,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:09:01,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:09:01,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:01,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:09:01,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:09:01,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:01" (1/1) ... [2019-12-18 15:09:01,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114282da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:01, skipping insertion in model container [2019-12-18 15:09:01,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:01" (1/1) ... [2019-12-18 15:09:01,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:09:01,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:09:02,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:02,447 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:09:02,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:02,588 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:09:02,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02 WrapperNode [2019-12-18 15:09:02,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:02,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:02,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:09:02,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:09:02,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:02,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:09:02,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:09:02,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:09:02,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (1/1) ... [2019-12-18 15:09:02,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:09:02,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:09:02,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:09:02,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:09:02,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (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 15:09:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:09:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:09:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:09:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:09:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:09:02,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:09:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:09:02,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:09:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:09:02,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:09:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:09:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:09:02,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:09:02,776 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 15:09:03,587 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:09:03,588 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:09:03,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:03 BoogieIcfgContainer [2019-12-18 15:09:03,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:09:03,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:09:03,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:09:03,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:09:03,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:09:01" (1/3) ... [2019-12-18 15:09:03,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7129798c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:03, skipping insertion in model container [2019-12-18 15:09:03,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:02" (2/3) ... [2019-12-18 15:09:03,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7129798c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:03, skipping insertion in model container [2019-12-18 15:09:03,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:03" (3/3) ... [2019-12-18 15:09:03,598 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2019-12-18 15:09:03,608 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:09:03,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:09:03,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:09:03,617 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:09:03,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,665 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,665 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,665 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,677 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,694 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,694 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,698 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,698 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:03,716 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:09:03,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:09:03,736 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:09:03,736 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:09:03,736 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:09:03,736 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:09:03,737 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:09:03,737 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:09:03,737 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:09:03,754 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-18 15:09:03,756 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 15:09:03,852 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 15:09:03,852 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:03,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:03,895 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 15:09:03,976 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 15:09:03,976 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:03,984 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:04,002 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 15:09:04,003 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:09:08,943 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 15:09:09,066 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 15:09:09,089 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-18 15:09:09,089 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 15:09:09,093 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-18 15:09:09,947 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-18 15:09:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-18 15:09:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:09:09,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:09,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:09,956 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-18 15:09:09,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:09,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496103212] [2019-12-18 15:09:09,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:10,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496103212] [2019-12-18 15:09:10,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:10,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:09:10,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749341268] [2019-12-18 15:09:10,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:10,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:10,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:10,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:10,252 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-18 15:09:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:10,744 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-18 15:09:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:10,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:09:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:11,003 INFO L225 Difference]: With dead ends: 15586 [2019-12-18 15:09:11,003 INFO L226 Difference]: Without dead ends: 15248 [2019-12-18 15:09:11,005 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 15:09:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-18 15:09:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-18 15:09:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-18 15:09:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-18 15:09:12,397 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-18 15:09:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:12,398 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-18 15:09:12,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-18 15:09:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:12,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:12,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:12,413 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-18 15:09:12,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:12,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247140606] [2019-12-18 15:09:12,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:12,598 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 15:09:12,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247140606] [2019-12-18 15:09:12,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:12,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:12,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995269831] [2019-12-18 15:09:12,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:12,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:12,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:12,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:12,604 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 4 states. [2019-12-18 15:09:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:13,358 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-18 15:09:13,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:13,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:09:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:13,460 INFO L225 Difference]: With dead ends: 24364 [2019-12-18 15:09:13,460 INFO L226 Difference]: Without dead ends: 24350 [2019-12-18 15:09:13,464 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 15:09:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-18 15:09:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-18 15:09:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-18 15:09:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-18 15:09:14,521 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-18 15:09:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:14,522 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-18 15:09:14,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-18 15:09:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:14,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:14,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:14,524 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-18 15:09:14,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:14,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002634489] [2019-12-18 15:09:14,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:14,560 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 15:09:14,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002634489] [2019-12-18 15:09:14,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:14,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:14,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118735281] [2019-12-18 15:09:14,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:14,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:14,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:14,563 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-18 15:09:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:14,625 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-18 15:09:14,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:14,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:09:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:14,665 INFO L225 Difference]: With dead ends: 12388 [2019-12-18 15:09:14,665 INFO L226 Difference]: Without dead ends: 12388 [2019-12-18 15:09:14,666 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 15:09:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-18 15:09:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-18 15:09:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-18 15:09:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-18 15:09:15,034 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-18 15:09:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:15,034 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-18 15:09:15,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-18 15:09:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:09:15,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:15,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:15,036 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-18 15:09:15,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:15,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037491939] [2019-12-18 15:09:15,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:15,925 WARN L192 SmtUtils]: Spent 852.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 15:09:15,930 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 15:09:15,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037491939] [2019-12-18 15:09:15,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:15,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:15,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793352542] [2019-12-18 15:09:15,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:15,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:15,935 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 4 states. [2019-12-18 15:09:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:15,958 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-18 15:09:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:09:15,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 15:09:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:15,967 INFO L225 Difference]: With dead ends: 1903 [2019-12-18 15:09:15,967 INFO L226 Difference]: Without dead ends: 1903 [2019-12-18 15:09:15,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-18 15:09:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-18 15:09:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-18 15:09:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-18 15:09:16,000 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-18 15:09:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:16,000 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-18 15:09:16,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-18 15:09:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:09:16,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:16,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:16,003 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:16,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:16,004 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-18 15:09:16,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:16,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304017640] [2019-12-18 15:09:16,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:16,092 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 15:09:16,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304017640] [2019-12-18 15:09:16,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:16,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:16,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203365330] [2019-12-18 15:09:16,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:16,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:16,094 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 5 states. [2019-12-18 15:09:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:16,120 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-18 15:09:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:16,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 15:09:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:16,122 INFO L225 Difference]: With dead ends: 669 [2019-12-18 15:09:16,122 INFO L226 Difference]: Without dead ends: 669 [2019-12-18 15:09:16,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-18 15:09:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-18 15:09:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 15:09:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-18 15:09:16,134 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-18 15:09:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:16,134 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-18 15:09:16,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-18 15:09:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:16,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:16,137 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 15:09:16,137 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-18 15:09:16,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:16,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67627970] [2019-12-18 15:09:16,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:16,213 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 15:09:16,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67627970] [2019-12-18 15:09:16,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:16,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528821984] [2019-12-18 15:09:16,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:16,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:16,216 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-18 15:09:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:16,256 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-18 15:09:16,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:16,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:09:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:16,261 INFO L225 Difference]: With dead ends: 610 [2019-12-18 15:09:16,261 INFO L226 Difference]: Without dead ends: 610 [2019-12-18 15:09:16,263 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 15:09:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-18 15:09:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-18 15:09:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 15:09:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-18 15:09:16,274 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-18 15:09:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:16,274 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-18 15:09:16,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-18 15:09:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:16,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:16,280 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 15:09:16,280 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-18 15:09:16,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:16,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411725411] [2019-12-18 15:09:16,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:16,469 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 15:09:16,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411725411] [2019-12-18 15:09:16,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:16,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:16,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256717129] [2019-12-18 15:09:16,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:16,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:16,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:16,475 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 3 states. [2019-12-18 15:09:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:16,496 INFO L93 Difference]: Finished difference Result 605 states and 1389 transitions. [2019-12-18 15:09:16,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:16,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:09:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:16,499 INFO L225 Difference]: With dead ends: 605 [2019-12-18 15:09:16,499 INFO L226 Difference]: Without dead ends: 605 [2019-12-18 15:09:16,499 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 15:09:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-12-18 15:09:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-12-18 15:09:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 15:09:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1389 transitions. [2019-12-18 15:09:16,509 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1389 transitions. Word has length 54 [2019-12-18 15:09:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:16,511 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1389 transitions. [2019-12-18 15:09:16,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1389 transitions. [2019-12-18 15:09:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:16,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:16,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:16,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1649873410, now seen corresponding path program 1 times [2019-12-18 15:09:16,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:16,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632794182] [2019-12-18 15:09:16,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:16,707 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 15:09:16,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632794182] [2019-12-18 15:09:16,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:16,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:09:16,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112607763] [2019-12-18 15:09:16,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:09:16,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:16,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:09:16,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:09:16,709 INFO L87 Difference]: Start difference. First operand 605 states and 1389 transitions. Second operand 8 states. [2019-12-18 15:09:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:17,179 INFO L93 Difference]: Finished difference Result 1054 states and 2429 transitions. [2019-12-18 15:09:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:09:17,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 15:09:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:17,182 INFO L225 Difference]: With dead ends: 1054 [2019-12-18 15:09:17,182 INFO L226 Difference]: Without dead ends: 1054 [2019-12-18 15:09:17,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:09:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-12-18 15:09:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 743. [2019-12-18 15:09:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-18 15:09:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1718 transitions. [2019-12-18 15:09:17,198 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1718 transitions. Word has length 55 [2019-12-18 15:09:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:17,199 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1718 transitions. [2019-12-18 15:09:17,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:09:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1718 transitions. [2019-12-18 15:09:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:17,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:17,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:17,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1435069556, now seen corresponding path program 2 times [2019-12-18 15:09:17,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:17,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462049648] [2019-12-18 15:09:17,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:17,326 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 15:09:17,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462049648] [2019-12-18 15:09:17,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:17,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:17,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949725785] [2019-12-18 15:09:17,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:17,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:17,328 INFO L87 Difference]: Start difference. First operand 743 states and 1718 transitions. Second operand 5 states. [2019-12-18 15:09:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:17,526 INFO L93 Difference]: Finished difference Result 963 states and 2203 transitions. [2019-12-18 15:09:17,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:17,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 15:09:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:17,528 INFO L225 Difference]: With dead ends: 963 [2019-12-18 15:09:17,528 INFO L226 Difference]: Without dead ends: 963 [2019-12-18 15:09:17,529 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 15:09:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-18 15:09:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 735. [2019-12-18 15:09:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-12-18 15:09:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1698 transitions. [2019-12-18 15:09:17,543 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1698 transitions. Word has length 55 [2019-12-18 15:09:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:17,545 INFO L462 AbstractCegarLoop]: Abstraction has 735 states and 1698 transitions. [2019-12-18 15:09:17,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1698 transitions. [2019-12-18 15:09:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:17,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:17,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:17,550 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2008175174, now seen corresponding path program 3 times [2019-12-18 15:09:17,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:17,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508466391] [2019-12-18 15:09:17,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:17,642 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 15:09:17,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508466391] [2019-12-18 15:09:17,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:17,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:17,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249227730] [2019-12-18 15:09:17,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:17,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:17,645 INFO L87 Difference]: Start difference. First operand 735 states and 1698 transitions. Second operand 3 states. [2019-12-18 15:09:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:17,689 INFO L93 Difference]: Finished difference Result 735 states and 1697 transitions. [2019-12-18 15:09:17,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:17,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:17,691 INFO L225 Difference]: With dead ends: 735 [2019-12-18 15:09:17,691 INFO L226 Difference]: Without dead ends: 735 [2019-12-18 15:09:17,692 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 15:09:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-12-18 15:09:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 498. [2019-12-18 15:09:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-18 15:09:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1149 transitions. [2019-12-18 15:09:17,702 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1149 transitions. Word has length 55 [2019-12-18 15:09:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:17,702 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1149 transitions. [2019-12-18 15:09:17,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1149 transitions. [2019-12-18 15:09:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:17,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:17,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:17,704 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash -529490788, now seen corresponding path program 1 times [2019-12-18 15:09:17,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:17,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5689542] [2019-12-18 15:09:17,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:17,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5689542] [2019-12-18 15:09:17,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:17,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:17,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151656998] [2019-12-18 15:09:17,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:17,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:17,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:17,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:17,839 INFO L87 Difference]: Start difference. First operand 498 states and 1149 transitions. Second operand 6 states. [2019-12-18 15:09:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:17,924 INFO L93 Difference]: Finished difference Result 892 states and 1870 transitions. [2019-12-18 15:09:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:17,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 15:09:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:17,926 INFO L225 Difference]: With dead ends: 892 [2019-12-18 15:09:17,927 INFO L226 Difference]: Without dead ends: 579 [2019-12-18 15:09:17,927 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 15:09:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-18 15:09:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 436. [2019-12-18 15:09:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-18 15:09:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 970 transitions. [2019-12-18 15:09:17,938 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 970 transitions. Word has length 56 [2019-12-18 15:09:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:17,938 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 970 transitions. [2019-12-18 15:09:17,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 970 transitions. [2019-12-18 15:09:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:17,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:17,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:17,940 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash -933211760, now seen corresponding path program 2 times [2019-12-18 15:09:17,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:17,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925375034] [2019-12-18 15:09:17,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:18,107 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 15:09:18,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925375034] [2019-12-18 15:09:18,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:18,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:18,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695396641] [2019-12-18 15:09:18,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:18,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:18,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:18,109 INFO L87 Difference]: Start difference. First operand 436 states and 970 transitions. Second operand 6 states. [2019-12-18 15:09:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:18,182 INFO L93 Difference]: Finished difference Result 707 states and 1527 transitions. [2019-12-18 15:09:18,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:18,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 15:09:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:18,184 INFO L225 Difference]: With dead ends: 707 [2019-12-18 15:09:18,184 INFO L226 Difference]: Without dead ends: 244 [2019-12-18 15:09:18,184 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 15:09:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-18 15:09:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 220. [2019-12-18 15:09:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-18 15:09:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-18 15:09:18,189 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 56 [2019-12-18 15:09:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:18,189 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-18 15:09:18,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-18 15:09:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:18,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:18,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:18,191 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 3 times [2019-12-18 15:09:18,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:18,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243089461] [2019-12-18 15:09:18,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:18,650 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 15:09:18,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243089461] [2019-12-18 15:09:18,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:18,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:09:18,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227702372] [2019-12-18 15:09:18,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:09:18,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:18,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:09:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:09:18,656 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 13 states. [2019-12-18 15:09:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:19,118 INFO L93 Difference]: Finished difference Result 384 states and 657 transitions. [2019-12-18 15:09:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:09:19,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 15:09:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:19,120 INFO L225 Difference]: With dead ends: 384 [2019-12-18 15:09:19,120 INFO L226 Difference]: Without dead ends: 354 [2019-12-18 15:09:19,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:09:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-18 15:09:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 320. [2019-12-18 15:09:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 15:09:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 558 transitions. [2019-12-18 15:09:19,126 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 558 transitions. Word has length 56 [2019-12-18 15:09:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:19,126 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 558 transitions. [2019-12-18 15:09:19,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:09:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 558 transitions. [2019-12-18 15:09:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:19,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:19,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:19,128 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 4 times [2019-12-18 15:09:19,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:19,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164478555] [2019-12-18 15:09:19,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:19,414 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 15:09:19,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164478555] [2019-12-18 15:09:19,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:19,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:09:19,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677793279] [2019-12-18 15:09:19,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:09:19,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:19,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:09:19,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:09:19,416 INFO L87 Difference]: Start difference. First operand 320 states and 558 transitions. Second operand 13 states. [2019-12-18 15:09:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:19,681 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2019-12-18 15:09:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:09:19,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 15:09:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:19,683 INFO L225 Difference]: With dead ends: 428 [2019-12-18 15:09:19,683 INFO L226 Difference]: Without dead ends: 398 [2019-12-18 15:09:19,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:09:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-18 15:09:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 328. [2019-12-18 15:09:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 15:09:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-18 15:09:19,689 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-18 15:09:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:19,689 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-18 15:09:19,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:09:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-18 15:09:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:19,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:19,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:19,691 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 5 times [2019-12-18 15:09:19,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:19,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093373350] [2019-12-18 15:09:19,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:19,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:09:19,829 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:09:19,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2498~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2498~0.base_27|) |v_ULTIMATE.start_main_~#t2498~0.offset_20| 0))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2498~0.base_27| 1) |v_#valid_59|) (= 0 v_~y$r_buff1_thd1~0_54) (= (select .cse0 |v_ULTIMATE.start_main_~#t2498~0.base_27|) 0) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2498~0.base_27|) (= |v_ULTIMATE.start_main_~#t2498~0.offset_20| 0) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2498~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_cnt~0_90) (= v_~y$r_buff1_thd0~0_237 0) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, ULTIMATE.start_main_~#t2499~0.offset=|v_ULTIMATE.start_main_~#t2499~0.offset_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2499~0.base=|v_ULTIMATE.start_main_~#t2499~0.base_20|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_~#t2500~0.offset=|v_ULTIMATE.start_main_~#t2500~0.offset_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t2498~0.offset=|v_ULTIMATE.start_main_~#t2498~0.offset_20|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, ULTIMATE.start_main_~#t2500~0.base=|v_ULTIMATE.start_main_~#t2500~0.base_20|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2498~0.base=|v_ULTIMATE.start_main_~#t2498~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2499~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2499~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2500~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2498~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t2500~0.base, #memory_int, ULTIMATE.start_main_~#t2498~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:19,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2499~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2499~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2499~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2499~0.base_9|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2499~0.base_9| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2499~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2499~0.base_9|) |v_ULTIMATE.start_main_~#t2499~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2499~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2499~0.base=|v_ULTIMATE.start_main_~#t2499~0.base_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2499~0.offset=|v_ULTIMATE.start_main_~#t2499~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2499~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2499~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 15:09:19,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2500~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2500~0.base_10|) |v_ULTIMATE.start_main_~#t2500~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2500~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2500~0.offset_9|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2500~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2500~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2500~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2500~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2500~0.base=|v_ULTIMATE.start_main_~#t2500~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2500~0.offset=|v_ULTIMATE.start_main_~#t2500~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2500~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2500~0.offset] because there is no mapped edge [2019-12-18 15:09:19,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= 2 ~y$w_buff0~0_Out1502813682) (= P2Thread1of1ForFork0_~arg.offset_Out1502813682 |P2Thread1of1ForFork0_#in~arg.offset_In1502813682|) (= |P2Thread1of1ForFork0_#in~arg.base_In1502813682| P2Thread1of1ForFork0_~arg.base_Out1502813682) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1502813682| 1) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1502813682| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1502813682) (= ~y$w_buff0_used~0_Out1502813682 1) (= ~y$w_buff1~0_Out1502813682 ~y$w_buff0~0_In1502813682) (= ~y$w_buff1_used~0_Out1502813682 ~y$w_buff0_used~0_In1502813682) (= (mod ~y$w_buff1_used~0_Out1502813682 256) 0)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1502813682|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1502813682, ~y$w_buff0~0=~y$w_buff0~0_In1502813682, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1502813682|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out1502813682, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1502813682|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1502813682|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1502813682, ~y$w_buff1~0=~y$w_buff1~0_Out1502813682, ~y$w_buff0~0=~y$w_buff0~0_Out1502813682, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out1502813682, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1502813682|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1502813682, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1502813682} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:19,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 15:09:19,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-499261307 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-499261307 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-499261307 |P2Thread1of1ForFork0_#t~ite11_Out-499261307|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-499261307|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-499261307, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-499261307} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-499261307, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-499261307|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-499261307} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 15:09:19,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-746896350 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-746896350 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite3_Out-746896350| |P1Thread1of1ForFork2_#t~ite4_Out-746896350|))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite3_Out-746896350| ~y~0_In-746896350)) (and (not .cse0) (not .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite3_Out-746896350| ~y$w_buff1~0_In-746896350)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-746896350, ~y$w_buff1~0=~y$w_buff1~0_In-746896350, ~y~0=~y~0_In-746896350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746896350} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-746896350, ~y$w_buff1~0=~y$w_buff1~0_In-746896350, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-746896350|, ~y~0=~y~0_In-746896350, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-746896350|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746896350} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 15:09:19,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1444549271 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1444549271 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1444549271 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1444549271 256)))) (or (and (= ~y$w_buff1_used~0_In1444549271 |P2Thread1of1ForFork0_#t~ite12_Out1444549271|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1444549271|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1444549271, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1444549271, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1444549271, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1444549271} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1444549271, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1444549271, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1444549271|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1444549271, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1444549271} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 15:09:19,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-746962730 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-746962730 256)))) (or (and (= ~y$w_buff0_used~0_In-746962730 |P1Thread1of1ForFork2_#t~ite5_Out-746962730|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-746962730|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-746962730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-746962730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-746962730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-746962730, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-746962730|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 15:09:19,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-703743591 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-703743591 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-703743591 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-703743591 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-703743591|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-703743591 |P1Thread1of1ForFork2_#t~ite6_Out-703743591|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-703743591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-703743591, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-703743591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-703743591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-703743591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-703743591, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-703743591, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-703743591|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-703743591} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 15:09:19,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1369180009 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1369180009 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1369180009| ~y$r_buff0_thd2~0_In1369180009)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1369180009| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1369180009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1369180009} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1369180009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1369180009, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1369180009|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 15:09:19,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1834453913 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1834453913 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1834453913 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1834453913 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-1834453913|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1834453913 |P1Thread1of1ForFork2_#t~ite8_Out-1834453913|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1834453913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834453913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1834453913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1834453913} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1834453913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834453913, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1834453913|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1834453913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1834453913} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 15:09:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 15:09:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-885845570 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-885845570 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-885845570 ~y$r_buff0_thd3~0_In-885845570)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out-885845570 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-885845570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-885845570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-885845570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-885845570, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-885845570|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 15:09:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1889061877 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1889061877 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1889061877 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1889061877 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-1889061877|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-1889061877 |P2Thread1of1ForFork0_#t~ite14_Out-1889061877|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1889061877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1889061877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1889061877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1889061877} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1889061877|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1889061877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1889061877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1889061877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1889061877} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 15:09:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 15:09:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 15:09:19,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-512995163 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-512995163| |ULTIMATE.start_main_#t~ite19_Out-512995163|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-512995163 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out-512995163| ~y~0_In-512995163) .cse0 (or .cse1 .cse2)) (and (= ~y$w_buff1~0_In-512995163 |ULTIMATE.start_main_#t~ite18_Out-512995163|) (not .cse2) .cse0 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-512995163, ~y~0=~y~0_In-512995163, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-512995163, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-512995163} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-512995163, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-512995163|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-512995163|, ~y~0=~y~0_In-512995163, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-512995163, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-512995163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:09:19,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1701532323 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1701532323 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1701532323|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1701532323 |ULTIMATE.start_main_#t~ite20_Out-1701532323|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701532323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1701532323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701532323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1701532323, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1701532323|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:09:19,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In802213325 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In802213325 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In802213325 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In802213325 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In802213325 |ULTIMATE.start_main_#t~ite21_Out802213325|)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out802213325|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In802213325, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In802213325, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In802213325, ~y$w_buff1_used~0=~y$w_buff1_used~0_In802213325} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In802213325, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In802213325, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out802213325|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In802213325, ~y$w_buff1_used~0=~y$w_buff1_used~0_In802213325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:09:19,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1235968731 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1235968731 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1235968731|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1235968731 |ULTIMATE.start_main_#t~ite22_Out-1235968731|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1235968731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1235968731} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1235968731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1235968731, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1235968731|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:09:19,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1123886033 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1123886033 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1123886033 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1123886033 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1123886033 |ULTIMATE.start_main_#t~ite23_Out1123886033|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite23_Out1123886033| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1123886033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1123886033, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1123886033, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1123886033} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1123886033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1123886033, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1123886033, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1123886033|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1123886033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 15:09:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-641150474 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-641150474| ~y$w_buff0~0_In-641150474) .cse0 (= |ULTIMATE.start_main_#t~ite29_Out-641150474| |ULTIMATE.start_main_#t~ite30_Out-641150474|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-641150474 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-641150474 256))) (and (= (mod ~y$r_buff1_thd0~0_In-641150474 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-641150474 256) 0)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out-641150474| ~y$w_buff0~0_In-641150474) (= |ULTIMATE.start_main_#t~ite29_In-641150474| |ULTIMATE.start_main_#t~ite29_Out-641150474|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-641150474, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-641150474|, ~y$w_buff0~0=~y$w_buff0~0_In-641150474, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-641150474, ~weak$$choice2~0=~weak$$choice2~0_In-641150474, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641150474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641150474} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-641150474|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-641150474, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-641150474|, ~y$w_buff0~0=~y$w_buff0~0_In-641150474, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-641150474, ~weak$$choice2~0=~weak$$choice2~0_In-641150474, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641150474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641150474} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 15:09:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In915759473 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In915759473| |ULTIMATE.start_main_#t~ite32_Out915759473|) (= ~y$w_buff1~0_In915759473 |ULTIMATE.start_main_#t~ite33_Out915759473|)) (and (= ~y$w_buff1~0_In915759473 |ULTIMATE.start_main_#t~ite32_Out915759473|) .cse0 (= |ULTIMATE.start_main_#t~ite33_Out915759473| |ULTIMATE.start_main_#t~ite32_Out915759473|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In915759473 256)))) (or (= (mod ~y$w_buff0_used~0_In915759473 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In915759473 256)) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In915759473 256) 0) .cse1)))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In915759473, ~y$w_buff0_used~0=~y$w_buff0_used~0_In915759473, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In915759473, ~weak$$choice2~0=~weak$$choice2~0_In915759473, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In915759473, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In915759473|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In915759473} OutVars{~y$w_buff1~0=~y$w_buff1~0_In915759473, ~y$w_buff0_used~0=~y$w_buff0_used~0_In915759473, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In915759473, ~weak$$choice2~0=~weak$$choice2~0_In915759473, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out915759473|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In915759473, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out915759473|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In915759473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 15:09:19,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In300230147 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In300230147| |ULTIMATE.start_main_#t~ite35_Out300230147|) (= |ULTIMATE.start_main_#t~ite36_Out300230147| ~y$w_buff0_used~0_In300230147)) (and (= |ULTIMATE.start_main_#t~ite36_Out300230147| |ULTIMATE.start_main_#t~ite35_Out300230147|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In300230147 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In300230147 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In300230147 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In300230147 256) 0))) .cse0 (= |ULTIMATE.start_main_#t~ite35_Out300230147| ~y$w_buff0_used~0_In300230147)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In300230147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In300230147, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In300230147|, ~weak$$choice2~0=~weak$$choice2~0_In300230147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In300230147, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300230147} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In300230147, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In300230147, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out300230147|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out300230147|, ~weak$$choice2~0=~weak$$choice2~0_In300230147, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In300230147, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300230147} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 15:09:19,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 15:09:19,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:09:19,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:09:19,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:09:19 BasicIcfg [2019-12-18 15:09:19,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:09:19,974 INFO L168 Benchmark]: Toolchain (without parser) took 18214.69 ms. Allocated memory was 147.3 MB in the beginning and 819.5 MB in the end (delta: 672.1 MB). Free memory was 103.4 MB in the beginning and 646.5 MB in the end (delta: -543.1 MB). Peak memory consumption was 440.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,974 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.08 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 103.0 MB in the beginning and 160.3 MB in the end (delta: -57.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 206.6 MB. Free memory was 160.3 MB in the beginning and 157.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,976 INFO L168 Benchmark]: Boogie Preprocessor took 39.10 ms. Allocated memory is still 206.6 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,977 INFO L168 Benchmark]: RCFGBuilder took 892.77 ms. Allocated memory is still 206.6 MB. Free memory was 155.2 MB in the beginning and 108.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,978 INFO L168 Benchmark]: TraceAbstraction took 16381.15 ms. Allocated memory was 206.6 MB in the beginning and 819.5 MB in the end (delta: 612.9 MB). Free memory was 108.8 MB in the beginning and 646.5 MB in the end (delta: -537.7 MB). Peak memory consumption was 386.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,981 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.08 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 103.0 MB in the beginning and 160.3 MB in the end (delta: -57.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 206.6 MB. Free memory was 160.3 MB in the beginning and 157.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.10 ms. Allocated memory is still 206.6 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 892.77 ms. Allocated memory is still 206.6 MB. Free memory was 155.2 MB in the beginning and 108.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16381.15 ms. Allocated memory was 206.6 MB in the beginning and 819.5 MB in the end (delta: 612.9 MB). Free memory was 108.8 MB in the beginning and 646.5 MB in the end (delta: -537.7 MB). Peak memory consumption was 386.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L746] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L820] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L821] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L822] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1312 SDtfs, 1112 SDslu, 3236 SDs, 0 SdLazy, 1336 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred 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: 2.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 3794 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 145631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...