/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:02:02,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:02:02,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:02:02,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:02:02,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:02:02,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:02:02,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:02:02,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:02:02,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:02:02,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:02:02,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:02:02,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:02:02,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:02:02,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:02:02,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:02:02,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:02:02,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:02:02,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:02:02,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:02:02,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:02:02,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:02:02,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:02:02,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:02:02,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:02:02,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:02:02,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:02:02,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:02:02,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:02:02,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:02:02,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:02:02,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:02:02,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:02:02,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:02:02,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:02:02,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:02:02,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:02:02,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:02:02,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:02:02,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:02:02,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:02:02,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:02:02,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:02:02,616 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:02:02,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:02:02,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:02:02,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:02:02,619 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:02:02,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:02:02,619 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:02:02,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:02:02,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:02:02,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:02:02,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:02:02,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:02:02,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:02:02,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:02:02,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:02:02,621 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:02:02,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:02:02,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:02:02,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:02:02,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:02:02,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:02:02,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:02:02,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:02:02,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:02:02,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:02:02,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:02:02,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:02:02,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:02:02,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:02:02,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:02:02,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:02:02,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:02:02,918 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:02:02,919 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:02:02,919 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-27 03:02:02,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88cf29299/ea53be3f166740a6876f8d91c374d433/FLAG44761e8ea [2019-12-27 03:02:03,472 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:02:03,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-27 03:02:03,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88cf29299/ea53be3f166740a6876f8d91c374d433/FLAG44761e8ea [2019-12-27 03:02:03,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88cf29299/ea53be3f166740a6876f8d91c374d433 [2019-12-27 03:02:03,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:02:03,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:02:03,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:02:03,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:02:03,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:02:03,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:02:03" (1/1) ... [2019-12-27 03:02:03,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:03, skipping insertion in model container [2019-12-27 03:02:03,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:02:03" (1/1) ... [2019-12-27 03:02:03,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:02:03,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:02:04,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:02:04,384 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:02:04,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:02:04,555 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:02:04,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04 WrapperNode [2019-12-27 03:02:04,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:02:04,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:02:04,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:02:04,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:02:04,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:02:04,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:02:04,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:02:04,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:02:04,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... [2019-12-27 03:02:04,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:02:04,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:02:04,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:02:04,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:02:04,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:02:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:02:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:02:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:02:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:02:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:02:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:02:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:02:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:02:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:02:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:02:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 03:02:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 03:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:02:04,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:02:04,775 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:02:05,588 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:02:05,589 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:02:05,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:02:05 BoogieIcfgContainer [2019-12-27 03:02:05,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:02:05,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:02:05,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:02:05,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:02:05,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:02:03" (1/3) ... [2019-12-27 03:02:05,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6004eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:02:05, skipping insertion in model container [2019-12-27 03:02:05,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:02:04" (2/3) ... [2019-12-27 03:02:05,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6004eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:02:05, skipping insertion in model container [2019-12-27 03:02:05,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:02:05" (3/3) ... [2019-12-27 03:02:05,600 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2019-12-27 03:02:05,610 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:02:05,610 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:02:05,618 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:02:05,619 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:02:05,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,662 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,662 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,670 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,671 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,671 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,671 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,672 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,672 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,672 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,706 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,707 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,711 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,712 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,714 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,717 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:02:05,745 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 03:02:05,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:02:05,764 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:02:05,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:02:05,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:02:05,764 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:02:05,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:02:05,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:02:05,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:02:05,783 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-27 03:02:05,785 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 03:02:05,885 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 03:02:05,886 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:02:05,901 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 03:02:05,923 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 03:02:05,974 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 03:02:05,975 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:02:05,981 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 03:02:05,997 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 03:02:05,998 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:02:09,391 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-27 03:02:10,958 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 03:02:11,322 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 03:02:11,468 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 03:02:11,495 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56276 [2019-12-27 03:02:11,495 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 03:02:11,499 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 100 transitions [2019-12-27 03:02:13,593 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32878 states. [2019-12-27 03:02:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 32878 states. [2019-12-27 03:02:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 03:02:13,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:13,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:13,604 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -667351009, now seen corresponding path program 1 times [2019-12-27 03:02:13,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:13,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241841945] [2019-12-27 03:02:13,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:14,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241841945] [2019-12-27 03:02:14,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:14,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:02:14,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448642486] [2019-12-27 03:02:14,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:02:14,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:02:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:14,585 INFO L87 Difference]: Start difference. First operand 32878 states. Second operand 3 states. [2019-12-27 03:02:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:15,152 INFO L93 Difference]: Finished difference Result 32686 states and 139960 transitions. [2019-12-27 03:02:15,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:15,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 03:02:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:15,429 INFO L225 Difference]: With dead ends: 32686 [2019-12-27 03:02:15,430 INFO L226 Difference]: Without dead ends: 32062 [2019-12-27 03:02:15,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32062 states. [2019-12-27 03:02:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32062 to 32062. [2019-12-27 03:02:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32062 states. [2019-12-27 03:02:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32062 states to 32062 states and 137412 transitions. [2019-12-27 03:02:17,169 INFO L78 Accepts]: Start accepts. Automaton has 32062 states and 137412 transitions. Word has length 9 [2019-12-27 03:02:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:17,170 INFO L462 AbstractCegarLoop]: Abstraction has 32062 states and 137412 transitions. [2019-12-27 03:02:17,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:02:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 32062 states and 137412 transitions. [2019-12-27 03:02:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 03:02:17,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:17,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:17,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash -139405083, now seen corresponding path program 1 times [2019-12-27 03:02:17,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:17,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990007434] [2019-12-27 03:02:17,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:17,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990007434] [2019-12-27 03:02:17,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:17,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:02:17,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539429818] [2019-12-27 03:02:17,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:02:17,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:02:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:02:17,273 INFO L87 Difference]: Start difference. First operand 32062 states and 137412 transitions. Second operand 4 states. [2019-12-27 03:02:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:19,243 INFO L93 Difference]: Finished difference Result 51166 states and 211740 transitions. [2019-12-27 03:02:19,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:02:19,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 03:02:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:19,533 INFO L225 Difference]: With dead ends: 51166 [2019-12-27 03:02:19,533 INFO L226 Difference]: Without dead ends: 51138 [2019-12-27 03:02:19,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:02:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51138 states. [2019-12-27 03:02:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51138 to 46670. [2019-12-27 03:02:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46670 states. [2019-12-27 03:02:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46670 states to 46670 states and 195108 transitions. [2019-12-27 03:02:21,917 INFO L78 Accepts]: Start accepts. Automaton has 46670 states and 195108 transitions. Word has length 15 [2019-12-27 03:02:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:21,917 INFO L462 AbstractCegarLoop]: Abstraction has 46670 states and 195108 transitions. [2019-12-27 03:02:21,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:02:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 46670 states and 195108 transitions. [2019-12-27 03:02:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 03:02:21,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:21,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:21,924 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2113277815, now seen corresponding path program 1 times [2019-12-27 03:02:21,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:21,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700369330] [2019-12-27 03:02:21,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:21,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700369330] [2019-12-27 03:02:21,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:21,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:02:21,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312078661] [2019-12-27 03:02:22,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:02:22,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:22,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:02:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:22,001 INFO L87 Difference]: Start difference. First operand 46670 states and 195108 transitions. Second operand 3 states. [2019-12-27 03:02:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:22,210 INFO L93 Difference]: Finished difference Result 36669 states and 141744 transitions. [2019-12-27 03:02:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:22,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 03:02:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:22,310 INFO L225 Difference]: With dead ends: 36669 [2019-12-27 03:02:22,311 INFO L226 Difference]: Without dead ends: 36669 [2019-12-27 03:02:22,311 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-27 03:02:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-12-27 03:02:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 36669. [2019-12-27 03:02:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36669 states. [2019-12-27 03:02:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36669 states to 36669 states and 141744 transitions. [2019-12-27 03:02:25,680 INFO L78 Accepts]: Start accepts. Automaton has 36669 states and 141744 transitions. Word has length 15 [2019-12-27 03:02:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:25,681 INFO L462 AbstractCegarLoop]: Abstraction has 36669 states and 141744 transitions. [2019-12-27 03:02:25,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:02:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 36669 states and 141744 transitions. [2019-12-27 03:02:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:02:25,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:25,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:25,683 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:25,684 INFO L82 PathProgramCache]: Analyzing trace with hash -456655226, now seen corresponding path program 1 times [2019-12-27 03:02:25,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:25,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524214170] [2019-12-27 03:02:25,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:25,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524214170] [2019-12-27 03:02:25,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:25,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:02:25,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858792718] [2019-12-27 03:02:25,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:02:25,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:25,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:02:25,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:02:25,728 INFO L87 Difference]: Start difference. First operand 36669 states and 141744 transitions. Second operand 4 states. [2019-12-27 03:02:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:25,817 INFO L93 Difference]: Finished difference Result 15339 states and 49236 transitions. [2019-12-27 03:02:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:02:25,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 03:02:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:25,845 INFO L225 Difference]: With dead ends: 15339 [2019-12-27 03:02:25,845 INFO L226 Difference]: Without dead ends: 15339 [2019-12-27 03:02:25,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:02:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15339 states. [2019-12-27 03:02:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15339 to 15339. [2019-12-27 03:02:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-12-27 03:02:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 49236 transitions. [2019-12-27 03:02:26,180 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 49236 transitions. Word has length 16 [2019-12-27 03:02:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:26,180 INFO L462 AbstractCegarLoop]: Abstraction has 15339 states and 49236 transitions. [2019-12-27 03:02:26,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:02:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 49236 transitions. [2019-12-27 03:02:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:02:26,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:26,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:26,182 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1764835742, now seen corresponding path program 1 times [2019-12-27 03:02:26,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:26,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215755770] [2019-12-27 03:02:26,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:26,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215755770] [2019-12-27 03:02:26,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:26,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:02:26,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281772639] [2019-12-27 03:02:26,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:02:26,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:02:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:02:26,248 INFO L87 Difference]: Start difference. First operand 15339 states and 49236 transitions. Second operand 5 states. [2019-12-27 03:02:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:26,290 INFO L93 Difference]: Finished difference Result 2638 states and 6819 transitions. [2019-12-27 03:02:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:02:26,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 03:02:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:26,294 INFO L225 Difference]: With dead ends: 2638 [2019-12-27 03:02:26,294 INFO L226 Difference]: Without dead ends: 2638 [2019-12-27 03:02:26,294 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-27 03:02:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2019-12-27 03:02:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2019-12-27 03:02:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2019-12-27 03:02:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6819 transitions. [2019-12-27 03:02:26,336 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6819 transitions. Word has length 17 [2019-12-27 03:02:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:26,336 INFO L462 AbstractCegarLoop]: Abstraction has 2638 states and 6819 transitions. [2019-12-27 03:02:26,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:02:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6819 transitions. [2019-12-27 03:02:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:02:26,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:26,341 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] [2019-12-27 03:02:26,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1144833891, now seen corresponding path program 1 times [2019-12-27 03:02:26,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:26,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506762610] [2019-12-27 03:02:26,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:26,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506762610] [2019-12-27 03:02:26,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:26,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:02:26,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353370667] [2019-12-27 03:02:26,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:02:26,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:02:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:26,414 INFO L87 Difference]: Start difference. First operand 2638 states and 6819 transitions. Second operand 6 states. [2019-12-27 03:02:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:26,456 INFO L93 Difference]: Finished difference Result 1222 states and 3487 transitions. [2019-12-27 03:02:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:02:26,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 03:02:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:26,459 INFO L225 Difference]: With dead ends: 1222 [2019-12-27 03:02:26,459 INFO L226 Difference]: Without dead ends: 1222 [2019-12-27 03:02:26,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-27 03:02:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1110. [2019-12-27 03:02:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-12-27 03:02:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3167 transitions. [2019-12-27 03:02:26,479 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3167 transitions. Word has length 29 [2019-12-27 03:02:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:26,479 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 3167 transitions. [2019-12-27 03:02:26,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:02:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3167 transitions. [2019-12-27 03:02:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:02:26,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:26,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:26,484 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:26,484 INFO L82 PathProgramCache]: Analyzing trace with hash -275883304, now seen corresponding path program 1 times [2019-12-27 03:02:26,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:26,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081714946] [2019-12-27 03:02:26,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:26,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081714946] [2019-12-27 03:02:26,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:26,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:02:26,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540662988] [2019-12-27 03:02:26,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:02:26,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:02:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:26,599 INFO L87 Difference]: Start difference. First operand 1110 states and 3167 transitions. Second operand 3 states. [2019-12-27 03:02:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:26,653 INFO L93 Difference]: Finished difference Result 1120 states and 3182 transitions. [2019-12-27 03:02:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:26,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 03:02:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:26,656 INFO L225 Difference]: With dead ends: 1120 [2019-12-27 03:02:26,656 INFO L226 Difference]: Without dead ends: 1120 [2019-12-27 03:02:26,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-27 03:02:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1114. [2019-12-27 03:02:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-27 03:02:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3175 transitions. [2019-12-27 03:02:26,675 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3175 transitions. Word has length 58 [2019-12-27 03:02:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:26,677 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 3175 transitions. [2019-12-27 03:02:26,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:02:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3175 transitions. [2019-12-27 03:02:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:02:26,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:26,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:26,683 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash -791070951, now seen corresponding path program 1 times [2019-12-27 03:02:26,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:26,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996096193] [2019-12-27 03:02:26,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:26,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996096193] [2019-12-27 03:02:26,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:26,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:02:26,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133375064] [2019-12-27 03:02:26,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:02:26,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:26,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:02:26,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:02:26,829 INFO L87 Difference]: Start difference. First operand 1114 states and 3175 transitions. Second operand 5 states. [2019-12-27 03:02:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:27,093 INFO L93 Difference]: Finished difference Result 1623 states and 4613 transitions. [2019-12-27 03:02:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:02:27,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 03:02:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:27,098 INFO L225 Difference]: With dead ends: 1623 [2019-12-27 03:02:27,098 INFO L226 Difference]: Without dead ends: 1623 [2019-12-27 03:02:27,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:02:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-12-27 03:02:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1210. [2019-12-27 03:02:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-27 03:02:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3463 transitions. [2019-12-27 03:02:27,121 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3463 transitions. Word has length 58 [2019-12-27 03:02:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:27,121 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 3463 transitions. [2019-12-27 03:02:27,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:02:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3463 transitions. [2019-12-27 03:02:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:02:27,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:27,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:27,126 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:27,126 INFO L82 PathProgramCache]: Analyzing trace with hash 867176459, now seen corresponding path program 2 times [2019-12-27 03:02:27,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:27,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738798077] [2019-12-27 03:02:27,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:27,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738798077] [2019-12-27 03:02:27,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:27,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:02:27,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361094934] [2019-12-27 03:02:27,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:02:27,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:27,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:02:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:27,297 INFO L87 Difference]: Start difference. First operand 1210 states and 3463 transitions. Second operand 6 states. [2019-12-27 03:02:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:28,040 INFO L93 Difference]: Finished difference Result 1488 states and 4124 transitions. [2019-12-27 03:02:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:02:28,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 03:02:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:28,043 INFO L225 Difference]: With dead ends: 1488 [2019-12-27 03:02:28,043 INFO L226 Difference]: Without dead ends: 1488 [2019-12-27 03:02:28,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:02:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-27 03:02:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1266. [2019-12-27 03:02:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-27 03:02:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3555 transitions. [2019-12-27 03:02:28,065 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3555 transitions. Word has length 58 [2019-12-27 03:02:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:28,065 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 3555 transitions. [2019-12-27 03:02:28,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:02:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3555 transitions. [2019-12-27 03:02:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:02:28,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:28,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:28,069 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2105802411, now seen corresponding path program 3 times [2019-12-27 03:02:28,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:28,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572995009] [2019-12-27 03:02:28,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:28,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572995009] [2019-12-27 03:02:28,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:28,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:02:28,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29193882] [2019-12-27 03:02:28,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:02:28,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:28,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:02:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:28,177 INFO L87 Difference]: Start difference. First operand 1266 states and 3555 transitions. Second operand 6 states. [2019-12-27 03:02:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:28,430 INFO L93 Difference]: Finished difference Result 1768 states and 4927 transitions. [2019-12-27 03:02:28,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:02:28,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 03:02:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:28,434 INFO L225 Difference]: With dead ends: 1768 [2019-12-27 03:02:28,435 INFO L226 Difference]: Without dead ends: 1768 [2019-12-27 03:02:28,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:02:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2019-12-27 03:02:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1294. [2019-12-27 03:02:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-12-27 03:02:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3635 transitions. [2019-12-27 03:02:28,455 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3635 transitions. Word has length 58 [2019-12-27 03:02:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:28,455 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 3635 transitions. [2019-12-27 03:02:28,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:02:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3635 transitions. [2019-12-27 03:02:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:02:28,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:28,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:28,459 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash -645544041, now seen corresponding path program 4 times [2019-12-27 03:02:28,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:28,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428738945] [2019-12-27 03:02:28,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:28,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428738945] [2019-12-27 03:02:28,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:28,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:02:28,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405013825] [2019-12-27 03:02:28,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:02:28,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:28,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:02:28,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:02:28,563 INFO L87 Difference]: Start difference. First operand 1294 states and 3635 transitions. Second operand 7 states. [2019-12-27 03:02:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:29,021 INFO L93 Difference]: Finished difference Result 2005 states and 5574 transitions. [2019-12-27 03:02:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:02:29,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 03:02:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:29,026 INFO L225 Difference]: With dead ends: 2005 [2019-12-27 03:02:29,027 INFO L226 Difference]: Without dead ends: 2005 [2019-12-27 03:02:29,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:02:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-12-27 03:02:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1294. [2019-12-27 03:02:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-12-27 03:02:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3635 transitions. [2019-12-27 03:02:29,048 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3635 transitions. Word has length 58 [2019-12-27 03:02:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:29,049 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 3635 transitions. [2019-12-27 03:02:29,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:02:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3635 transitions. [2019-12-27 03:02:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:02:29,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:29,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:29,053 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash -515953626, now seen corresponding path program 1 times [2019-12-27 03:02:29,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:29,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028333931] [2019-12-27 03:02:29,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:29,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028333931] [2019-12-27 03:02:29,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:29,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:02:29,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560618092] [2019-12-27 03:02:29,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:02:29,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:29,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:02:29,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:29,192 INFO L87 Difference]: Start difference. First operand 1294 states and 3635 transitions. Second operand 6 states. [2019-12-27 03:02:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:29,292 INFO L93 Difference]: Finished difference Result 2574 states and 6703 transitions. [2019-12-27 03:02:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:02:29,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 03:02:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:29,294 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 03:02:29,294 INFO L226 Difference]: Without dead ends: 1036 [2019-12-27 03:02:29,295 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-27 03:02:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-27 03:02:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 706. [2019-12-27 03:02:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-12-27 03:02:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1623 transitions. [2019-12-27 03:02:29,305 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1623 transitions. Word has length 59 [2019-12-27 03:02:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:29,306 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 1623 transitions. [2019-12-27 03:02:29,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:02:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1623 transitions. [2019-12-27 03:02:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:02:29,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:29,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:29,308 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1334298476, now seen corresponding path program 1 times [2019-12-27 03:02:29,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:29,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635494291] [2019-12-27 03:02:29,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:29,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635494291] [2019-12-27 03:02:29,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:29,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:02:29,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777294804] [2019-12-27 03:02:29,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:02:29,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:29,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:02:29,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:29,413 INFO L87 Difference]: Start difference. First operand 706 states and 1623 transitions. Second operand 6 states. [2019-12-27 03:02:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:29,533 INFO L93 Difference]: Finished difference Result 1002 states and 2153 transitions. [2019-12-27 03:02:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:02:29,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 03:02:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:29,534 INFO L225 Difference]: With dead ends: 1002 [2019-12-27 03:02:29,535 INFO L226 Difference]: Without dead ends: 627 [2019-12-27 03:02:29,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:02:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-12-27 03:02:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-12-27 03:02:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-12-27 03:02:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1395 transitions. [2019-12-27 03:02:29,546 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1395 transitions. Word has length 59 [2019-12-27 03:02:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:29,547 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 1395 transitions. [2019-12-27 03:02:29,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:02:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1395 transitions. [2019-12-27 03:02:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:02:29,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:29,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, 1, 1, 1, 1] [2019-12-27 03:02:29,549 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:29,550 INFO L82 PathProgramCache]: Analyzing trace with hash -914229092, now seen corresponding path program 2 times [2019-12-27 03:02:29,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:29,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964253948] [2019-12-27 03:02:29,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:29,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964253948] [2019-12-27 03:02:29,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:29,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:02:29,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010731808] [2019-12-27 03:02:29,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:02:29,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:29,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:02:29,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:29,609 INFO L87 Difference]: Start difference. First operand 627 states and 1395 transitions. Second operand 3 states. [2019-12-27 03:02:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:29,629 INFO L93 Difference]: Finished difference Result 609 states and 1342 transitions. [2019-12-27 03:02:29,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:29,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 03:02:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:29,630 INFO L225 Difference]: With dead ends: 609 [2019-12-27 03:02:29,630 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 03:02:29,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 03:02:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2019-12-27 03:02:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-12-27 03:02:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1342 transitions. [2019-12-27 03:02:29,640 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1342 transitions. Word has length 59 [2019-12-27 03:02:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:29,640 INFO L462 AbstractCegarLoop]: Abstraction has 609 states and 1342 transitions. [2019-12-27 03:02:29,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:02:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1342 transitions. [2019-12-27 03:02:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:02:29,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:29,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:29,642 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1243267760, now seen corresponding path program 2 times [2019-12-27 03:02:29,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:29,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595112027] [2019-12-27 03:02:29,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:29,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595112027] [2019-12-27 03:02:29,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:29,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:02:29,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361076142] [2019-12-27 03:02:29,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:02:29,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:02:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:29,742 INFO L87 Difference]: Start difference. First operand 609 states and 1342 transitions. Second operand 3 states. [2019-12-27 03:02:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:29,801 INFO L93 Difference]: Finished difference Result 608 states and 1340 transitions. [2019-12-27 03:02:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:29,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 03:02:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:29,803 INFO L225 Difference]: With dead ends: 608 [2019-12-27 03:02:29,803 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 03:02:29,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 03:02:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 449. [2019-12-27 03:02:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-27 03:02:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 979 transitions. [2019-12-27 03:02:29,812 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 979 transitions. Word has length 59 [2019-12-27 03:02:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:29,813 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 979 transitions. [2019-12-27 03:02:29,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:02:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 979 transitions. [2019-12-27 03:02:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:02:29,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:29,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:29,814 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash -837634653, now seen corresponding path program 1 times [2019-12-27 03:02:29,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:29,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132595634] [2019-12-27 03:02:29,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:29,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132595634] [2019-12-27 03:02:29,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:29,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:02:29,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557104909] [2019-12-27 03:02:29,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:02:29,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:29,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:02:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:29,970 INFO L87 Difference]: Start difference. First operand 449 states and 979 transitions. Second operand 6 states. [2019-12-27 03:02:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:30,058 INFO L93 Difference]: Finished difference Result 703 states and 1474 transitions. [2019-12-27 03:02:30,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:02:30,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 03:02:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:30,060 INFO L225 Difference]: With dead ends: 703 [2019-12-27 03:02:30,060 INFO L226 Difference]: Without dead ends: 245 [2019-12-27 03:02:30,060 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-27 03:02:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-27 03:02:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2019-12-27 03:02:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-27 03:02:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 368 transitions. [2019-12-27 03:02:30,064 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 368 transitions. Word has length 60 [2019-12-27 03:02:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:30,064 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 368 transitions. [2019-12-27 03:02:30,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:02:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 368 transitions. [2019-12-27 03:02:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:02:30,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:30,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:30,065 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash -524819563, now seen corresponding path program 2 times [2019-12-27 03:02:30,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:30,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650822189] [2019-12-27 03:02:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:02:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:02:30,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:02:30,296 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:02:30,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~weak$$choice2~0_146 0) (= v_~z$w_buff0_used~0_885 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$r_buff1_thd0~0_298 0) (= 0 v_~z$r_buff1_thd2~0_83) (= 0 v_~z$r_buff1_thd4~0_140) (= 0 v_~z$r_buff1_thd1~0_83) (= 0 v_~z$flush_delayed~0_36) (= v_~z$r_buff0_thd3~0_92 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24|) 0) (= 0 |v_ULTIMATE.start_main_~#t1525~0.offset_18|) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p3_EAX~0_100 0) (= v_~z$w_buff0~0_503 0) (= v_~z$w_buff1_used~0_515 0) (= v_~a~0_48 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1525~0.base_24|) (= v_~x~0_57 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z~0_155 0) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~__unbuffered_cnt~0_141 0) (= 0 v_~z$r_buff1_thd3~0_146) (= v_~z$w_buff1~0_306 0) (= v_~z$r_buff0_thd0~0_394 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd2~0_32 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24|) |v_ULTIMATE.start_main_~#t1525~0.offset_18| 0)) |v_#memory_int_25|) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd4~0_161) (= v_~y~0_76 0) (= v_~z$r_buff0_thd1~0_32 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1525~0.base_24| 4)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_59|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_83, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_41|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_32|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_35|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_394, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_161, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_48|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_114|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_515, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_191|, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ULTIMATE.start_main_~#t1525~0.offset=|v_ULTIMATE.start_main_~#t1525~0.offset_18|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_35|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_22|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_~#t1525~0.base=|v_ULTIMATE.start_main_~#t1525~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_38|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_92, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_57, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_140, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~z$w_buff1~0=v_~z$w_buff1~0_306, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_298, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_25|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_20|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_17|, ~y~0=v_~y~0_76, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_885, ~z$w_buff0~0=v_~z$w_buff0~0_503, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_39|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_146, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_122|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_36|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_23|, ~z~0=v_~z~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1527~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1525~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1525~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1526~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1527~0.base, ULTIMATE.start_main_~#t1528~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, 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, ULTIMATE.start_main_~#t1528~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:02:30,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1526~0.offset_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1526~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1526~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10|) |v_ULTIMATE.start_main_~#t1526~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1526~0.base_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_10|, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_~#t1526~0.offset] because there is no mapped edge [2019-12-27 03:02:30,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L823-1-->L825: Formula: (and (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12| 1)) (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1527~0.base_12| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1527~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1527~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12|) |v_ULTIMATE.start_main_~#t1527~0.offset_10| 2)) |v_#memory_int_17|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1527~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1527~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1527~0.base, #length] because there is no mapped edge [2019-12-27 03:02:30,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L825-1-->L827: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1528~0.base_11| 4) |v_#length_19|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1528~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11|) |v_ULTIMATE.start_main_~#t1528~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1528~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1528~0.offset] because there is no mapped edge [2019-12-27 03:02:30,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11| 1) (= v_P3Thread1of1ForFork2_~arg.offset_11 |v_P3Thread1of1ForFork2_#in~arg.offset_11|) (= (mod v_~z$w_buff1_used~0_99 256) 0) (= |v_P3Thread1of1ForFork2_#in~arg.base_11| v_P3Thread1of1ForFork2_~arg.base_11) (= v_~z$w_buff0_used~0_218 1) (= v_~z$w_buff0~0_48 v_~z$w_buff1~0_32) (= 2 v_~z$w_buff0~0_47) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_219 v_~z$w_buff1_used~0_99)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_219, ~z$w_buff0~0=v_~z$w_buff0~0_48, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_218, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, ~z$w_buff1~0=v_~z$w_buff1~0_32, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_11, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 03:02:30,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_19 |v_P0Thread1of1ForFork3_#in~arg.base_19|) (= v_~x~0_44 1) (= 0 |v_P0Thread1of1ForFork3_#res.base_11|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_19| v_P0Thread1of1ForFork3_~arg.offset_19) (= 0 |v_P0Thread1of1ForFork3_#res.offset_11|) (= v_~a~0_40 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_19, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_11|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 03:02:30,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_39 2) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_~y~0_50 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_10| v_P1Thread1of1ForFork0_~arg.offset_10) (= v_P1Thread1of1ForFork0_~arg.base_10 |v_P1Thread1of1ForFork0_#in~arg.base_10|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_10, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_10, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_50, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 03:02:30,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite3_Out1479537678| |P2Thread1of1ForFork1_#t~ite4_Out1479537678|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1479537678 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1479537678 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork1_#t~ite3_Out1479537678| ~z~0_In1479537678)) (and .cse0 (not .cse2) (not .cse1) (= ~z$w_buff1~0_In1479537678 |P2Thread1of1ForFork1_#t~ite3_Out1479537678|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1479537678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1479537678, ~z$w_buff1~0=~z$w_buff1~0_In1479537678, ~z~0=~z~0_In1479537678} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out1479537678|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out1479537678|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1479537678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1479537678, ~z$w_buff1~0=~z$w_buff1~0_In1479537678, ~z~0=~z~0_In1479537678} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 03:02:30,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In632018479 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In632018479 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite5_Out632018479| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite5_Out632018479| ~z$w_buff0_used~0_In632018479) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In632018479, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In632018479} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out632018479|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In632018479, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In632018479} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 03:02:30,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-466554850 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-466554850 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-466554850 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-466554850 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite6_Out-466554850| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-466554850 |P2Thread1of1ForFork1_#t~ite6_Out-466554850|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-466554850, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-466554850, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-466554850, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-466554850} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out-466554850|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-466554850, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-466554850, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-466554850, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-466554850} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 03:02:30,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-933554341 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-933554341 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite7_Out-933554341|)) (and (= ~z$r_buff0_thd3~0_In-933554341 |P2Thread1of1ForFork1_#t~ite7_Out-933554341|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-933554341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-933554341} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out-933554341|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-933554341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-933554341} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 03:02:30,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1083413811 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1083413811 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1083413811 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1083413811 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite8_Out1083413811|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite8_Out1083413811| ~z$r_buff1_thd3~0_In1083413811) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1083413811, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1083413811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1083413811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1083413811} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1083413811, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1083413811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1083413811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1083413811, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1083413811|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 03:02:30,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~z$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork1_#t~ite8_46|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_46|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_45|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 03:02:30,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1375662957 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1375662957 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite11_Out1375662957| ~z$w_buff0_used~0_In1375662957)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork2_#t~ite11_Out1375662957| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1375662957, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1375662957} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1375662957, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1375662957, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out1375662957|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 03:02:30,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1850032629 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1850032629 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1850032629 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1850032629 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1850032629 |P3Thread1of1ForFork2_#t~ite12_Out-1850032629|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite12_Out-1850032629|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1850032629, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850032629, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1850032629, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1850032629} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1850032629, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850032629, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1850032629, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1850032629, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out-1850032629|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 03:02:30,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In100763436 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In100763436 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out100763436) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out100763436 ~z$r_buff0_thd4~0_In100763436) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In100763436, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In100763436} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In100763436, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out100763436|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out100763436} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 03:02:30,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In454584712 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In454584712 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In454584712 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In454584712 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite14_Out454584712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In454584712 |P3Thread1of1ForFork2_#t~ite14_Out454584712|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In454584712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In454584712, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In454584712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In454584712} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In454584712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In454584712, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In454584712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In454584712, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out454584712|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 03:02:30,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L802-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite14_56| v_~z$r_buff1_thd4~0_130) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_130, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_55|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:02:30,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_21) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 03:02:30,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-770697725 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-770697725 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-770697725 |ULTIMATE.start_main_#t~ite19_Out-770697725|) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-770697725 |ULTIMATE.start_main_#t~ite19_Out-770697725|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-770697725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770697725, ~z$w_buff1~0=~z$w_buff1~0_In-770697725, ~z~0=~z~0_In-770697725} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-770697725|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-770697725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770697725, ~z$w_buff1~0=~z$w_buff1~0_In-770697725, ~z~0=~z~0_In-770697725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 03:02:30,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_31, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:02:30,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1443756345 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1443756345 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1443756345| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out1443756345| ~z$w_buff0_used~0_In1443756345) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1443756345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1443756345} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1443756345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1443756345, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1443756345|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:02:30,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-774595828 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-774595828 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-774595828 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-774595828 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-774595828|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-774595828 |ULTIMATE.start_main_#t~ite22_Out-774595828|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-774595828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774595828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-774595828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-774595828} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-774595828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774595828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-774595828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-774595828, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-774595828|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:02:30,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1170660975 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1170660975 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1170660975|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1170660975 |ULTIMATE.start_main_#t~ite23_Out-1170660975|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1170660975, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1170660975} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1170660975, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1170660975, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1170660975|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 03:02:30,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1784739831 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1784739831 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1784739831 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1784739831 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1784739831 |ULTIMATE.start_main_#t~ite24_Out1784739831|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite24_Out1784739831|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1784739831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1784739831, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1784739831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784739831} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1784739831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1784739831, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1784739831, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1784739831|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784739831} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 03:02:30,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_119 v_~z$r_buff0_thd0~0_120) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:02:30,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L850-->L850-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-960314389 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-960314389| |ULTIMATE.start_main_#t~ite45_Out-960314389|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-960314389 256)))) (or (= (mod ~z$w_buff0_used~0_In-960314389 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-960314389 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd0~0_In-960314389 256)) .cse0))) .cse1 (= ~z$r_buff1_thd0~0_In-960314389 |ULTIMATE.start_main_#t~ite45_Out-960314389|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-960314389| ~z$r_buff1_thd0~0_In-960314389) (= |ULTIMATE.start_main_#t~ite45_In-960314389| |ULTIMATE.start_main_#t~ite45_Out-960314389|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-960314389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-960314389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-960314389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-960314389, ~weak$$choice2~0=~weak$$choice2~0_In-960314389, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-960314389|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-960314389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-960314389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-960314389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-960314389, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-960314389|, ~weak$$choice2~0=~weak$$choice2~0_In-960314389, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-960314389|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:02:30,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L852-->L855-1: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_120) (= 0 v_~z$flush_delayed~0_24) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= 0 (mod v_~z$flush_delayed~0_25 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_25} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:02:30,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:02:30,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:02:30 BasicIcfg [2019-12-27 03:02:30,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:02:30,512 INFO L168 Benchmark]: Toolchain (without parser) took 26694.04 ms. Allocated memory was 144.7 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 99.8 MB in the beginning and 631.6 MB in the end (delta: -531.8 MB). Peak memory consumption was 516.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:30,514 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:02:30,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.66 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 99.4 MB in the beginning and 156.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:30,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.32 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:30,518 INFO L168 Benchmark]: Boogie Preprocessor took 37.53 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:30,519 INFO L168 Benchmark]: RCFGBuilder took 925.40 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 102.2 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:30,519 INFO L168 Benchmark]: TraceAbstraction took 24918.25 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 989.9 MB). Free memory was 102.2 MB in the beginning and 631.6 MB in the end (delta: -529.3 MB). Peak memory consumption was 460.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:30,527 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.66 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 99.4 MB in the beginning and 156.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.32 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.53 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 925.40 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 102.2 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24918.25 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 989.9 MB). Free memory was 102.2 MB in the beginning and 631.6 MB in the end (delta: -529.3 MB). Peak memory consumption was 460.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 178 ProgramPointsBefore, 91 ProgramPointsAfterwards, 206 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 24 ChoiceCompositions, 4617 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 231 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 56276 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L845] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L847] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1783 SDtfs, 1563 SDslu, 3289 SDs, 0 SdLazy, 1502 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46670occurred 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: 8.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 6927 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 747 NumberOfCodeBlocks, 747 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 671 ConstructedInterpolants, 0 QuantifiedInterpolants, 98241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...