/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/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:59:56,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:59:56,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:59:56,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:59:56,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:59:56,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:59:56,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:59:56,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:59:56,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:59:56,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:59:56,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:59:56,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:59:56,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:59:56,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:59:56,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:59:56,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:59:56,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:59:56,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:59:56,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:59:56,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:59:56,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:59:56,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:59:56,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:59:56,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:59:56,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:59:56,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:59:56,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:59:56,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:59:56,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:59:56,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:59:56,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:59:56,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:59:56,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:59:56,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:59:56,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:59:56,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:59:56,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:59:56,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:59:56,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:59:56,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:59:56,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:59:56,524 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 02:59:56,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:59:56,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:59:56,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:59:56,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:59:56,563 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:59:56,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:59:56,564 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:59:56,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:59:56,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:59:56,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:59:56,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:59:56,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:59:56,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:59:56,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:59:56,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:59:56,567 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:59:56,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:59:56,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:59:56,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:59:56,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:59:56,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:59:56,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:59:56,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:59:56,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:59:56,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:59:56,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:59:56,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:59:56,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:59:56,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:59:56,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:59:56,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:59:56,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:59:56,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:59:56,890 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:59:56,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-27 02:59:56,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8849a5e1/0a8cf9b8a0b7416593fdddfab83785d3/FLAG6ac250a86 [2019-12-27 02:59:57,504 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:59:57,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-27 02:59:57,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8849a5e1/0a8cf9b8a0b7416593fdddfab83785d3/FLAG6ac250a86 [2019-12-27 02:59:57,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8849a5e1/0a8cf9b8a0b7416593fdddfab83785d3 [2019-12-27 02:59:57,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:59:57,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:59:57,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:59:57,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:59:57,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:59:57,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:59:57" (1/1) ... [2019-12-27 02:59:57,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:57, skipping insertion in model container [2019-12-27 02:59:57,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:59:57" (1/1) ... [2019-12-27 02:59:57,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:59:57,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:59:58,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:59:58,501 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:59:58,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:59:58,640 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:59:58,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58 WrapperNode [2019-12-27 02:59:58,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:59:58,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:59:58,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:59:58,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:59:58,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:59:58,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:59:58,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:59:58,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:59:58,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (1/1) ... [2019-12-27 02:59:58,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:59:58,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:59:58,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:59:58,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:59:58,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (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 02:59:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:59:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:59:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:59:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:59:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:59:58,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:59:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:59:58,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:59:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:59:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:59:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:59:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:59:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:59:58,865 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 02:59:59,586 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:59:59,587 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:59:59,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:59:59 BoogieIcfgContainer [2019-12-27 02:59:59,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:59:59,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:59:59,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:59:59,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:59:59,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:59:57" (1/3) ... [2019-12-27 02:59:59,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587e3bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:59:59, skipping insertion in model container [2019-12-27 02:59:59,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:58" (2/3) ... [2019-12-27 02:59:59,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587e3bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:59:59, skipping insertion in model container [2019-12-27 02:59:59,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:59:59" (3/3) ... [2019-12-27 02:59:59,597 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2019-12-27 02:59:59,608 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:59:59,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:59:59,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:59:59,618 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:59:59,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,664 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,664 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,677 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,677 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,679 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,682 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,696 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,698 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:59,739 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:59:59,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:59:59,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:59:59,759 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:59:59,759 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:59:59,759 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:59:59,759 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:59:59,760 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:59:59,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:59:59,782 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 02:59:59,783 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 02:59:59,882 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 02:59:59,882 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:59:59,897 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:59:59,914 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 02:59:59,962 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 02:59:59,962 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:59:59,968 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:59:59,982 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 02:59:59,983 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:00:04,499 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:00:04,636 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:00:04,655 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-27 03:00:04,656 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:00:04,659 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:00:05,760 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-27 03:00:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-27 03:00:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 03:00:05,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:05,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:05,768 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:05,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:05,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-27 03:00:05,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:05,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714473387] [2019-12-27 03:00:05,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:06,074 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:00:06,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714473387] [2019-12-27 03:00:06,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:06,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:00:06,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178635669] [2019-12-27 03:00:06,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:06,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:06,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:06,100 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-27 03:00:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:06,412 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-27 03:00:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:06,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 03:00:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:06,576 INFO L225 Difference]: With dead ends: 16398 [2019-12-27 03:00:06,576 INFO L226 Difference]: Without dead ends: 16062 [2019-12-27 03:00:06,578 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:00:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-27 03:00:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-27 03:00:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-27 03:00:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-27 03:00:07,873 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-27 03:00:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:07,874 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-27 03:00:07,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-27 03:00:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:00:07,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:07,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:07,880 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-27 03:00:07,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:07,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054681936] [2019-12-27 03:00:07,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:07,958 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:00:07,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054681936] [2019-12-27 03:00:07,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:07,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:07,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865999835] [2019-12-27 03:00:07,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:07,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:07,963 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-27 03:00:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:08,556 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-27 03:00:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:08,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:00:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:08,657 INFO L225 Difference]: With dead ends: 24942 [2019-12-27 03:00:08,658 INFO L226 Difference]: Without dead ends: 24928 [2019-12-27 03:00:08,658 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:00:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-27 03:00:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-27 03:00:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-27 03:00:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-27 03:00:09,575 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-27 03:00:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:09,575 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-27 03:00:09,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-27 03:00:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:00:09,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:09,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:09,579 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-27 03:00:09,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:09,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091335512] [2019-12-27 03:00:09,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:09,657 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:00:09,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091335512] [2019-12-27 03:00:09,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:09,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:09,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844775661] [2019-12-27 03:00:09,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:09,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:09,659 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-27 03:00:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:09,741 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-27 03:00:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:09,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:00:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:09,793 INFO L225 Difference]: With dead ends: 12675 [2019-12-27 03:00:09,794 INFO L226 Difference]: Without dead ends: 12675 [2019-12-27 03:00:09,794 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:00:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-27 03:00:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-27 03:00:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-27 03:00:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-27 03:00:10,999 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-27 03:00:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:11,000 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-27 03:00:11,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-27 03:00:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:00:11,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:11,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:11,002 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:11,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-27 03:00:11,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:11,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40546448] [2019-12-27 03:00:11,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:11,064 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:00:11,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40546448] [2019-12-27 03:00:11,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:11,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:11,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958004023] [2019-12-27 03:00:11,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:11,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:11,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:11,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:11,067 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-27 03:00:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:11,091 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-27 03:00:11,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:00:11,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:00:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:11,098 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 03:00:11,098 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 03:00:11,098 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:00:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 03:00:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 03:00:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 03:00:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-27 03:00:11,135 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-27 03:00:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:11,136 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-27 03:00:11,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-27 03:00:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:00:11,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:11,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:11,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-27 03:00:11,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:11,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403566174] [2019-12-27 03:00:11,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:11,198 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:00:11,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403566174] [2019-12-27 03:00:11,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:11,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:11,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545510661] [2019-12-27 03:00:11,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:11,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:11,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:11,201 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-27 03:00:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:11,228 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 03:00:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:11,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 03:00:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:11,231 INFO L225 Difference]: With dead ends: 653 [2019-12-27 03:00:11,231 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 03:00:11,231 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:00:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 03:00:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 03:00:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 03:00:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 03:00:11,243 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 03:00:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:11,243 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 03:00:11,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 03:00:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:11,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:11,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:11,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-27 03:00:11,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:11,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073182635] [2019-12-27 03:00:11,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:11,328 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:00:11,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073182635] [2019-12-27 03:00:11,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:11,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:11,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013348794] [2019-12-27 03:00:11,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:11,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:11,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:11,331 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 03:00:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:11,381 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-27 03:00:11,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:11,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:00:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:11,383 INFO L225 Difference]: With dead ends: 607 [2019-12-27 03:00:11,383 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 03:00:11,383 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:00:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 03:00:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-27 03:00:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-27 03:00:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-27 03:00:11,394 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-27 03:00:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:11,394 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-27 03:00:11,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-27 03:00:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:11,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:11,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:11,397 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:11,397 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-27 03:00:11,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:11,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297777459] [2019-12-27 03:00:11,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:11,526 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:00:11,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297777459] [2019-12-27 03:00:11,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:11,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:11,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945008205] [2019-12-27 03:00:11,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:11,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:11,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:11,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:11,531 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-27 03:00:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:11,760 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-27 03:00:11,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:00:11,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 03:00:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:11,763 INFO L225 Difference]: With dead ends: 892 [2019-12-27 03:00:11,763 INFO L226 Difference]: Without dead ends: 892 [2019-12-27 03:00:11,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-27 03:00:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-27 03:00:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-27 03:00:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-27 03:00:11,779 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-27 03:00:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:11,780 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-27 03:00:11,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-27 03:00:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:11,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:11,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:11,783 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-27 03:00:11,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:11,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162856767] [2019-12-27 03:00:11,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:11,936 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:00:11,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162856767] [2019-12-27 03:00:11,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:11,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:11,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076385733] [2019-12-27 03:00:11,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:11,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:11,939 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 6 states. [2019-12-27 03:00:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:12,275 INFO L93 Difference]: Finished difference Result 1189 states and 2773 transitions. [2019-12-27 03:00:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:00:12,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 03:00:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:12,278 INFO L225 Difference]: With dead ends: 1189 [2019-12-27 03:00:12,278 INFO L226 Difference]: Without dead ends: 1189 [2019-12-27 03:00:12,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:00:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-12-27 03:00:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 759. [2019-12-27 03:00:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 03:00:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-27 03:00:12,299 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-27 03:00:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:12,300 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-27 03:00:12,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-27 03:00:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:12,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:12,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:12,304 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-27 03:00:12,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:12,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230309133] [2019-12-27 03:00:12,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:12,525 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:00:12,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230309133] [2019-12-27 03:00:12,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:12,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:12,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550215933] [2019-12-27 03:00:12,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:12,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:12,528 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 6 states. [2019-12-27 03:00:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:12,841 INFO L93 Difference]: Finished difference Result 1185 states and 2766 transitions. [2019-12-27 03:00:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:00:12,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 03:00:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:12,843 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 03:00:12,844 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 03:00:12,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:00:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 03:00:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 839. [2019-12-27 03:00:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-12-27 03:00:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1986 transitions. [2019-12-27 03:00:12,859 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1986 transitions. Word has length 55 [2019-12-27 03:00:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:12,859 INFO L462 AbstractCegarLoop]: Abstraction has 839 states and 1986 transitions. [2019-12-27 03:00:12,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1986 transitions. [2019-12-27 03:00:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:00:12,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:12,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:12,862 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 817618467, now seen corresponding path program 4 times [2019-12-27 03:00:12,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:12,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915900667] [2019-12-27 03:00:12,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:12,913 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:00:12,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915900667] [2019-12-27 03:00:12,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:12,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:12,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375199335] [2019-12-27 03:00:12,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:12,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:12,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:12,915 INFO L87 Difference]: Start difference. First operand 839 states and 1986 transitions. Second operand 3 states. [2019-12-27 03:00:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:12,930 INFO L93 Difference]: Finished difference Result 737 states and 1703 transitions. [2019-12-27 03:00:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:12,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:00:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:12,931 INFO L225 Difference]: With dead ends: 737 [2019-12-27 03:00:12,931 INFO L226 Difference]: Without dead ends: 737 [2019-12-27 03:00:12,932 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:00:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-27 03:00:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-12-27 03:00:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-27 03:00:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1703 transitions. [2019-12-27 03:00:12,942 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1703 transitions. Word has length 55 [2019-12-27 03:00:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:12,943 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1703 transitions. [2019-12-27 03:00:12,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1703 transitions. [2019-12-27 03:00:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:00:12,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:12,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:12,945 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 1 times [2019-12-27 03:00:12,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:12,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255802980] [2019-12-27 03:00:12,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:13,011 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:00:13,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255802980] [2019-12-27 03:00:13,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:13,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:13,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898529235] [2019-12-27 03:00:13,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:13,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:13,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:13,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:13,014 INFO L87 Difference]: Start difference. First operand 737 states and 1703 transitions. Second operand 3 states. [2019-12-27 03:00:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:13,054 INFO L93 Difference]: Finished difference Result 736 states and 1701 transitions. [2019-12-27 03:00:13,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:13,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 03:00:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:13,055 INFO L225 Difference]: With dead ends: 736 [2019-12-27 03:00:13,055 INFO L226 Difference]: Without dead ends: 736 [2019-12-27 03:00:13,056 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:00:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-12-27 03:00:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 473. [2019-12-27 03:00:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-27 03:00:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-27 03:00:13,073 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-27 03:00:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:13,073 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-27 03:00:13,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-27 03:00:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:13,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:13,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:13,077 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-27 03:00:13,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:13,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908937051] [2019-12-27 03:00:13,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:13,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:00:13,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908937051] [2019-12-27 03:00:13,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:13,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:13,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171735888] [2019-12-27 03:00:13,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:00:13,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:13,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:00:13,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:13,248 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 7 states. [2019-12-27 03:00:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:13,378 INFO L93 Difference]: Finished difference Result 879 states and 1872 transitions. [2019-12-27 03:00:13,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:00:13,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 03:00:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:13,380 INFO L225 Difference]: With dead ends: 879 [2019-12-27 03:00:13,380 INFO L226 Difference]: Without dead ends: 578 [2019-12-27 03:00:13,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:00:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-27 03:00:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-27 03:00:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-27 03:00:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-27 03:00:13,387 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-27 03:00:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:13,387 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-27 03:00:13,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:00:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-27 03:00:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:13,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:13,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:13,389 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:13,389 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-27 03:00:13,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:13,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276345957] [2019-12-27 03:00:13,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:13,530 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:00:13,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276345957] [2019-12-27 03:00:13,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:13,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:13,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554235274] [2019-12-27 03:00:13,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:13,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:13,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:13,532 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 6 states. [2019-12-27 03:00:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:13,603 INFO L93 Difference]: Finished difference Result 644 states and 1366 transitions. [2019-12-27 03:00:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:00:13,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 03:00:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:13,604 INFO L225 Difference]: With dead ends: 644 [2019-12-27 03:00:13,604 INFO L226 Difference]: Without dead ends: 231 [2019-12-27 03:00:13,605 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:00:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-27 03:00:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-27 03:00:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-27 03:00:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-27 03:00:13,609 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-27 03:00:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:13,609 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-27 03:00:13,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-27 03:00:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:13,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:13,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:13,610 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-27 03:00:13,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:13,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426402874] [2019-12-27 03:00:13,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:13,860 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:00:13,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426402874] [2019-12-27 03:00:13,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:13,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:00:13,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429157154] [2019-12-27 03:00:13,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:00:13,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:13,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:00:13,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:00:13,863 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 13 states. [2019-12-27 03:00:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:14,440 INFO L93 Difference]: Finished difference Result 371 states and 637 transitions. [2019-12-27 03:00:14,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:00:14,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 03:00:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:14,441 INFO L225 Difference]: With dead ends: 371 [2019-12-27 03:00:14,442 INFO L226 Difference]: Without dead ends: 341 [2019-12-27 03:00:14,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:00:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-27 03:00:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2019-12-27 03:00:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-27 03:00:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-27 03:00:14,449 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-27 03:00:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:14,450 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-27 03:00:14,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:00:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-27 03:00:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:14,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:14,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:14,452 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 4 times [2019-12-27 03:00:14,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:14,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742835084] [2019-12-27 03:00:14,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:14,754 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:00:14,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742835084] [2019-12-27 03:00:14,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:14,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:00:14,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102383630] [2019-12-27 03:00:14,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:00:14,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:14,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:00:14,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:00:14,757 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 13 states. [2019-12-27 03:00:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:15,234 INFO L93 Difference]: Finished difference Result 415 states and 703 transitions. [2019-12-27 03:00:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:00:15,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 03:00:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:15,235 INFO L225 Difference]: With dead ends: 415 [2019-12-27 03:00:15,235 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 03:00:15,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:00:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 03:00:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 315. [2019-12-27 03:00:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-27 03:00:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-27 03:00:15,245 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-27 03:00:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:15,245 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-27 03:00:15,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:00:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-27 03:00:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:00:15,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:15,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:15,247 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 5 times [2019-12-27 03:00:15,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:15,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736800781] [2019-12-27 03:00:15,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:00:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:00:15,383 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:00:15,383 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:00:15,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1492~0.base_26| 4)) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1492~0.base_26|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= 0 |v_ULTIMATE.start_main_~#t1492~0.offset_19|) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1492~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1492~0.base_26|) |v_ULTIMATE.start_main_~#t1492~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_26| 1) |v_#valid_60|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= v_~main$tmp_guard0~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_26|)) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_21|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_26|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t1492~0.offset=|v_ULTIMATE.start_main_~#t1492~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_~#t1492~0.base=|v_ULTIMATE.start_main_~#t1492~0.base_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1493~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1494~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1494~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1493~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1492~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1492~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:00:15,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1493~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1493~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1493~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13|) |v_ULTIMATE.start_main_~#t1493~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_11|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1493~0.offset, ULTIMATE.start_main_~#t1493~0.base] because there is no mapped edge [2019-12-27 03:00:15,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1494~0.offset_10|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1494~0.base_12|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12| 1) |v_#valid_38|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12|) |v_ULTIMATE.start_main_~#t1494~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1494~0.offset, ULTIMATE.start_main_~#t1494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 03:00:15,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:00:15,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 03:00:15,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2133500316 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In2133500316 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out2133500316| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out2133500316| ~y$w_buff0_used~0_In2133500316)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2133500316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133500316} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2133500316, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out2133500316|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133500316} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 03:00:15,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In675507667 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In675507667 256)))) (or (and (= ~y~0_In675507667 |P1Thread1of1ForFork2_#t~ite3_Out675507667|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In675507667 |P1Thread1of1ForFork2_#t~ite3_Out675507667|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In675507667, ~y$w_buff1~0=~y$w_buff1~0_In675507667, ~y~0=~y~0_In675507667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In675507667} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In675507667, ~y$w_buff1~0=~y$w_buff1~0_In675507667, ~y~0=~y~0_In675507667, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out675507667|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In675507667} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:00:15,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:00:15,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1531371876 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1531371876 256) 0))) (or (and (= ~y$w_buff0_used~0_In1531371876 |P1Thread1of1ForFork2_#t~ite5_Out1531371876|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out1531371876|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1531371876, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1531371876} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1531371876, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1531371876, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1531371876|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 03:00:15,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In2111479662 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In2111479662 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2111479662 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2111479662 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out2111479662| ~y$w_buff1_used~0_In2111479662) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite6_Out2111479662| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2111479662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2111479662, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2111479662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111479662} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2111479662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2111479662, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2111479662, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out2111479662|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111479662} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 03:00:15,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In651880286 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In651880286 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In651880286 |P1Thread1of1ForFork2_#t~ite7_Out651880286|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out651880286|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In651880286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In651880286} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In651880286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In651880286, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out651880286|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 03:00:15,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In223875335 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In223875335 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In223875335 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In223875335 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out223875335| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out223875335| ~y$w_buff1_used~0_In223875335)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In223875335, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223875335, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In223875335, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223875335} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In223875335, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223875335, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out223875335|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In223875335, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223875335} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 03:00:15,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1027649747 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1027649747 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1027649747 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1027649747 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1027649747|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1027649747 |P1Thread1of1ForFork2_#t~ite8_Out1027649747|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1027649747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1027649747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1027649747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1027649747} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1027649747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1027649747, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1027649747|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1027649747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1027649747} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 03:00:15,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 03:00:15,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1577363244 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1577363244 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-1577363244 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1577363244 ~y$r_buff0_thd3~0_Out-1577363244)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1577363244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1577363244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1577363244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1577363244, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1577363244|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 03:00:15,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In126667114 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In126667114 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In126667114 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In126667114 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out126667114| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite14_Out126667114| ~y$r_buff1_thd3~0_In126667114) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In126667114, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126667114, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In126667114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126667114} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out126667114|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In126667114, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126667114, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In126667114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126667114} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 03:00:15,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 03:00:15,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:00:15,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1613976284 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1613976284 256) 0))) (or (and (= ~y$w_buff1~0_In1613976284 |ULTIMATE.start_main_#t~ite18_Out1613976284|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out1613976284| ~y~0_In1613976284)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1613976284, ~y~0=~y~0_In1613976284, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1613976284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1613976284} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1613976284, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1613976284|, ~y~0=~y~0_In1613976284, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1613976284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1613976284} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 03:00:15,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 03:00:15,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-714552394 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-714552394 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-714552394|)) (and (= ~y$w_buff0_used~0_In-714552394 |ULTIMATE.start_main_#t~ite20_Out-714552394|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-714552394, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-714552394} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-714552394, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-714552394, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-714552394|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:00:15,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1423552465 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1423552465 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1423552465 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1423552465 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1423552465| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1423552465 |ULTIMATE.start_main_#t~ite21_Out1423552465|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1423552465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1423552465, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1423552465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423552465} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1423552465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1423552465, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1423552465|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1423552465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423552465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:00:15,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-679234063 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-679234063 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-679234063| ~y$r_buff0_thd0~0_In-679234063)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-679234063| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-679234063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-679234063} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-679234063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-679234063, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-679234063|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:00:15,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1431813931 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1431813931 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1431813931 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1431813931 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1431813931| 0)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1431813931| ~y$r_buff1_thd0~0_In-1431813931) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1431813931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1431813931, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1431813931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1431813931} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1431813931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1431813931, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1431813931, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1431813931|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1431813931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 03:00:15,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-96010548 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In-96010548| |ULTIMATE.start_main_#t~ite29_Out-96010548|) (= |ULTIMATE.start_main_#t~ite30_Out-96010548| ~y$w_buff0~0_In-96010548)) (and (= |ULTIMATE.start_main_#t~ite30_Out-96010548| |ULTIMATE.start_main_#t~ite29_Out-96010548|) (= ~y$w_buff0~0_In-96010548 |ULTIMATE.start_main_#t~ite29_Out-96010548|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-96010548 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-96010548 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-96010548 256))) (= (mod ~y$w_buff0_used~0_In-96010548 256) 0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-96010548, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-96010548|, ~y$w_buff0~0=~y$w_buff0~0_In-96010548, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-96010548, ~weak$$choice2~0=~weak$$choice2~0_In-96010548, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-96010548, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96010548} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-96010548|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96010548, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-96010548|, ~y$w_buff0~0=~y$w_buff0~0_In-96010548, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-96010548, ~weak$$choice2~0=~weak$$choice2~0_In-96010548, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-96010548, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96010548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:00:15,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:00:15,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:00:15,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:00:15,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:00:15 BasicIcfg [2019-12-27 03:00:15,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:00:15,513 INFO L168 Benchmark]: Toolchain (without parser) took 17678.54 ms. Allocated memory was 140.0 MB in the beginning and 827.9 MB in the end (delta: 687.9 MB). Free memory was 102.7 MB in the beginning and 539.6 MB in the end (delta: -436.9 MB). Peak memory consumption was 251.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:15,513 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 03:00:15,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.70 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 102.5 MB in the beginning and 157.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:15,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.43 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:15,516 INFO L168 Benchmark]: Boogie Preprocessor took 49.35 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:15,516 INFO L168 Benchmark]: RCFGBuilder took 803.41 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 105.5 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:15,517 INFO L168 Benchmark]: TraceAbstraction took 15921.25 ms. Allocated memory was 203.4 MB in the beginning and 827.9 MB in the end (delta: 624.4 MB). Free memory was 104.9 MB in the beginning and 539.6 MB in the end (delta: -434.7 MB). Peak memory consumption was 189.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:15,521 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.70 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 102.5 MB in the beginning and 157.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 92.43 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.35 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 803.41 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 105.5 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15921.25 ms. Allocated memory was 203.4 MB in the beginning and 827.9 MB in the end (delta: 624.4 MB). Free memory was 104.9 MB in the beginning and 539.6 MB in the end (delta: -434.7 MB). Peak memory consumption was 189.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1499 SDtfs, 1568 SDslu, 3269 SDs, 0 SdLazy, 1628 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 27 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred 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: 3.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 4331 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 115379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...