/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/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:27:11,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:27:11,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:27:11,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:27:11,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:27:11,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:27:11,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:27:11,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:27:11,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:27:11,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:27:11,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:27:11,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:27:11,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:27:11,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:27:11,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:27:11,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:27:11,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:27:11,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:27:11,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:27:11,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:27:11,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:27:11,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:27:11,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:27:11,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:27:11,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:27:11,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:27:11,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:27:11,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:27:11,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:27:11,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:27:11,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:27:11,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:27:11,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:27:11,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:27:11,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:27:11,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:27:11,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:27:11,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:27:11,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:27:11,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:27:11,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:27:11,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:27:11,561 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:27:11,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:27:11,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:27:11,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:27:11,563 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:27:11,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:27:11,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:27:11,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:27:11,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:27:11,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:27:11,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:27:11,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:27:11,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:27:11,564 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:27:11,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:27:11,565 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:27:11,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:27:11,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:27:11,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:27:11,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:27:11,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:27:11,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:27:11,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:27:11,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:27:11,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:27:11,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:27:11,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:27:11,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:27:11,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:27:11,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:27:11,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:27:11,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:27:11,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:27:11,854 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:27:11,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-18 17:27:11,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e480929/d0245843a2c347be96ed6cc7bbdcb2cf/FLAGe79f9ceb3 [2019-12-18 17:27:12,515 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:27:12,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-18 17:27:12,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e480929/d0245843a2c347be96ed6cc7bbdcb2cf/FLAGe79f9ceb3 [2019-12-18 17:27:12,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e480929/d0245843a2c347be96ed6cc7bbdcb2cf [2019-12-18 17:27:12,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:27:12,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:27:12,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:27:12,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:27:12,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:27:12,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:27:12" (1/1) ... [2019-12-18 17:27:12,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:12, skipping insertion in model container [2019-12-18 17:27:12,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:27:12" (1/1) ... [2019-12-18 17:27:12,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:27:12,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:27:13,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:27:13,439 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:27:13,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:27:13,606 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:27:13,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13 WrapperNode [2019-12-18 17:27:13,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:27:13,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:27:13,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:27:13,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:27:13,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:27:13,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:27:13,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:27:13,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:27:13,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... [2019-12-18 17:27:13,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:27:13,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:27:13,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:27:13,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:27:13,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:27:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:27:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:27:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:27:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:27:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:27:13,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:27:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:27:13,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:27:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:27:13,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:27:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:27:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:27:13,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:27:13,789 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:27:14,545 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:27:14,546 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:27:14,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:27:14 BoogieIcfgContainer [2019-12-18 17:27:14,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:27:14,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:27:14,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:27:14,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:27:14,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:27:12" (1/3) ... [2019-12-18 17:27:14,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad052eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:27:14, skipping insertion in model container [2019-12-18 17:27:14,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:27:13" (2/3) ... [2019-12-18 17:27:14,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad052eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:27:14, skipping insertion in model container [2019-12-18 17:27:14,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:27:14" (3/3) ... [2019-12-18 17:27:14,556 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2019-12-18 17:27:14,566 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:27:14,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:27:14,575 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:27:14,576 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:27:14,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,640 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,641 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,642 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:27:14,663 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:27:14,682 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:27:14,682 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:27:14,682 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:27:14,682 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:27:14,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:27:14,683 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:27:14,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:27:14,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:27:14,717 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 17:27:14,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 17:27:14,826 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 17:27:14,826 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:27:14,840 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:27:14,862 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 17:27:14,904 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 17:27:14,904 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:27:14,913 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:27:14,932 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:27:14,933 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:27:19,487 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-18 17:27:19,593 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-18 17:27:19,922 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 17:27:20,046 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:27:20,075 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-18 17:27:20,076 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 17:27:20,080 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-18 17:27:20,920 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 17:27:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 17:27:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:27:20,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:20,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:20,931 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:20,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 17:27:20,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:20,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965657456] [2019-12-18 17:27:20,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:21,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965657456] [2019-12-18 17:27:21,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:21,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:27:21,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508847388] [2019-12-18 17:27:21,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:21,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:21,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:21,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:21,232 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 17:27:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:21,598 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-18 17:27:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:21,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:27:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:21,747 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 17:27:21,747 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 17:27:21,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 17:27:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 17:27:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 17:27:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-18 17:27:23,183 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-18 17:27:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:23,184 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-18 17:27:23,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-18 17:27:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:27:23,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:23,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:23,189 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 17:27:23,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:23,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391676411] [2019-12-18 17:27:23,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:23,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391676411] [2019-12-18 17:27:23,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:23,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:23,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901784899] [2019-12-18 17:27:23,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:23,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:23,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:23,313 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-18 17:27:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:23,676 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-18 17:27:23,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:23,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:27:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:23,738 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 17:27:23,738 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 17:27:23,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 17:27:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 17:27:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 17:27:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-18 17:27:24,589 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-18 17:27:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:24,590 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-18 17:27:24,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-18 17:27:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:27:24,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:24,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:24,597 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 17:27:24,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:24,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761193557] [2019-12-18 17:27:24,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:24,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761193557] [2019-12-18 17:27:24,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:24,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:24,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392541356] [2019-12-18 17:27:24,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:24,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:24,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:24,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:24,728 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-18 17:27:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:26,025 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-18 17:27:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:26,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:27:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:26,107 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 17:27:26,107 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 17:27:26,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 17:27:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-18 17:27:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-18 17:27:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-18 17:27:27,032 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-18 17:27:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:27,033 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-18 17:27:27,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-18 17:27:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 17:27:27,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:27,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:27,040 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 17:27:27,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:27,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058927749] [2019-12-18 17:27:27,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:27,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058927749] [2019-12-18 17:27:27,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:27,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:27,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146681491] [2019-12-18 17:27:27,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:27,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:27,111 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-18 17:27:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:27,640 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-18 17:27:27,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:27:27,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 17:27:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:27,748 INFO L225 Difference]: With dead ends: 30132 [2019-12-18 17:27:27,748 INFO L226 Difference]: Without dead ends: 30118 [2019-12-18 17:27:27,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-18 17:27:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-18 17:27:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-18 17:27:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-18 17:27:28,801 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-18 17:27:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:28,802 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-18 17:27:28,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-18 17:27:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:27:28,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:28,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:28,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-18 17:27:28,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:28,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189747331] [2019-12-18 17:27:28,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:28,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189747331] [2019-12-18 17:27:28,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:28,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:27:28,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852995051] [2019-12-18 17:27:28,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:27:28,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:27:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:28,973 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 6 states. [2019-12-18 17:27:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:29,779 INFO L93 Difference]: Finished difference Result 32606 states and 115328 transitions. [2019-12-18 17:27:29,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:27:29,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:27:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:29,883 INFO L225 Difference]: With dead ends: 32606 [2019-12-18 17:27:29,883 INFO L226 Difference]: Without dead ends: 32574 [2019-12-18 17:27:29,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32574 states. [2019-12-18 17:27:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32574 to 28036. [2019-12-18 17:27:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28036 states. [2019-12-18 17:27:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28036 states to 28036 states and 100001 transitions. [2019-12-18 17:27:32,172 INFO L78 Accepts]: Start accepts. Automaton has 28036 states and 100001 transitions. Word has length 27 [2019-12-18 17:27:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:32,172 INFO L462 AbstractCegarLoop]: Abstraction has 28036 states and 100001 transitions. [2019-12-18 17:27:32,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:27:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 28036 states and 100001 transitions. [2019-12-18 17:27:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:27:32,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:32,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:32,208 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:32,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1188296037, now seen corresponding path program 1 times [2019-12-18 17:27:32,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:32,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751266771] [2019-12-18 17:27:32,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:32,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751266771] [2019-12-18 17:27:32,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:32,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:32,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027124462] [2019-12-18 17:27:32,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:32,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:32,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:32,257 INFO L87 Difference]: Start difference. First operand 28036 states and 100001 transitions. Second operand 3 states. [2019-12-18 17:27:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:32,475 INFO L93 Difference]: Finished difference Result 35568 states and 127677 transitions. [2019-12-18 17:27:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:32,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 17:27:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:32,567 INFO L225 Difference]: With dead ends: 35568 [2019-12-18 17:27:32,567 INFO L226 Difference]: Without dead ends: 35568 [2019-12-18 17:27:32,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35568 states. [2019-12-18 17:27:33,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35568 to 31188. [2019-12-18 17:27:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31188 states. [2019-12-18 17:27:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31188 states to 31188 states and 112337 transitions. [2019-12-18 17:27:33,415 INFO L78 Accepts]: Start accepts. Automaton has 31188 states and 112337 transitions. Word has length 33 [2019-12-18 17:27:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:33,415 INFO L462 AbstractCegarLoop]: Abstraction has 31188 states and 112337 transitions. [2019-12-18 17:27:33,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 31188 states and 112337 transitions. [2019-12-18 17:27:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:27:33,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:33,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:33,448 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:33,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1536973783, now seen corresponding path program 1 times [2019-12-18 17:27:33,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:33,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843350808] [2019-12-18 17:27:33,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:33,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843350808] [2019-12-18 17:27:33,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:33,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:33,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832154335] [2019-12-18 17:27:33,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:33,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:33,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:33,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:33,519 INFO L87 Difference]: Start difference. First operand 31188 states and 112337 transitions. Second operand 4 states. [2019-12-18 17:27:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:33,607 INFO L93 Difference]: Finished difference Result 18039 states and 56038 transitions. [2019-12-18 17:27:33,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:27:33,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 17:27:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:33,640 INFO L225 Difference]: With dead ends: 18039 [2019-12-18 17:27:33,640 INFO L226 Difference]: Without dead ends: 17509 [2019-12-18 17:27:33,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2019-12-18 17:27:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 17509. [2019-12-18 17:27:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-18 17:27:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54532 transitions. [2019-12-18 17:27:34,183 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54532 transitions. Word has length 33 [2019-12-18 17:27:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:34,184 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54532 transitions. [2019-12-18 17:27:34,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54532 transitions. [2019-12-18 17:27:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:27:34,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:34,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:34,199 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash 345963664, now seen corresponding path program 1 times [2019-12-18 17:27:34,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:34,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10182299] [2019-12-18 17:27:34,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:34,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10182299] [2019-12-18 17:27:34,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:34,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:34,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143779913] [2019-12-18 17:27:34,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:34,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:34,262 INFO L87 Difference]: Start difference. First operand 17509 states and 54532 transitions. Second operand 3 states. [2019-12-18 17:27:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:34,363 INFO L93 Difference]: Finished difference Result 17509 states and 54339 transitions. [2019-12-18 17:27:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:34,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 17:27:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:34,388 INFO L225 Difference]: With dead ends: 17509 [2019-12-18 17:27:34,388 INFO L226 Difference]: Without dead ends: 17509 [2019-12-18 17:27:34,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2019-12-18 17:27:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 17509. [2019-12-18 17:27:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-18 17:27:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54339 transitions. [2019-12-18 17:27:34,630 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54339 transitions. Word has length 34 [2019-12-18 17:27:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:34,631 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54339 transitions. [2019-12-18 17:27:34,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54339 transitions. [2019-12-18 17:27:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:27:34,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:34,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:34,644 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1096312539, now seen corresponding path program 1 times [2019-12-18 17:27:34,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:34,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338020077] [2019-12-18 17:27:34,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:34,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338020077] [2019-12-18 17:27:34,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:34,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:34,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842597409] [2019-12-18 17:27:34,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:27:34,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:34,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:27:34,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:34,742 INFO L87 Difference]: Start difference. First operand 17509 states and 54339 transitions. Second operand 7 states. [2019-12-18 17:27:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:35,694 INFO L93 Difference]: Finished difference Result 23341 states and 70914 transitions. [2019-12-18 17:27:35,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:27:35,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 17:27:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:35,728 INFO L225 Difference]: With dead ends: 23341 [2019-12-18 17:27:35,729 INFO L226 Difference]: Without dead ends: 23313 [2019-12-18 17:27:35,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:27:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23313 states. [2019-12-18 17:27:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23313 to 15958. [2019-12-18 17:27:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15958 states. [2019-12-18 17:27:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 49857 transitions. [2019-12-18 17:27:36,011 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 49857 transitions. Word has length 34 [2019-12-18 17:27:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:36,011 INFO L462 AbstractCegarLoop]: Abstraction has 15958 states and 49857 transitions. [2019-12-18 17:27:36,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:27:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 49857 transitions. [2019-12-18 17:27:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:27:36,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:36,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:36,024 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -308537285, now seen corresponding path program 1 times [2019-12-18 17:27:36,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:36,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007315709] [2019-12-18 17:27:36,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:36,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007315709] [2019-12-18 17:27:36,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:36,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:27:36,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201527338] [2019-12-18 17:27:36,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:36,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:36,100 INFO L87 Difference]: Start difference. First operand 15958 states and 49857 transitions. Second operand 5 states. [2019-12-18 17:27:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:36,149 INFO L93 Difference]: Finished difference Result 2712 states and 6343 transitions. [2019-12-18 17:27:36,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:36,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 17:27:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:36,153 INFO L225 Difference]: With dead ends: 2712 [2019-12-18 17:27:36,153 INFO L226 Difference]: Without dead ends: 2403 [2019-12-18 17:27:36,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-12-18 17:27:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2019-12-18 17:27:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-18 17:27:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5482 transitions. [2019-12-18 17:27:36,186 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5482 transitions. Word has length 34 [2019-12-18 17:27:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:36,188 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5482 transitions. [2019-12-18 17:27:36,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5482 transitions. [2019-12-18 17:27:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 17:27:36,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:36,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:36,194 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:36,195 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-18 17:27:36,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:36,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925110007] [2019-12-18 17:27:36,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:36,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925110007] [2019-12-18 17:27:36,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:36,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:36,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75619275] [2019-12-18 17:27:36,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:27:36,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:36,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:27:36,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:36,335 INFO L87 Difference]: Start difference. First operand 2403 states and 5482 transitions. Second operand 6 states. [2019-12-18 17:27:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:36,398 INFO L93 Difference]: Finished difference Result 708 states and 1600 transitions. [2019-12-18 17:27:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:27:36,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 17:27:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:36,400 INFO L225 Difference]: With dead ends: 708 [2019-12-18 17:27:36,400 INFO L226 Difference]: Without dead ends: 662 [2019-12-18 17:27:36,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-18 17:27:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 606. [2019-12-18 17:27:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 17:27:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1378 transitions. [2019-12-18 17:27:36,409 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1378 transitions. Word has length 45 [2019-12-18 17:27:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:36,411 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1378 transitions. [2019-12-18 17:27:36,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:27:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1378 transitions. [2019-12-18 17:27:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:27:36,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:36,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:36,413 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1345831558, now seen corresponding path program 1 times [2019-12-18 17:27:36,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:36,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488821920] [2019-12-18 17:27:36,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:36,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488821920] [2019-12-18 17:27:36,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:36,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:36,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112052866] [2019-12-18 17:27:36,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:36,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:36,531 INFO L87 Difference]: Start difference. First operand 606 states and 1378 transitions. Second operand 5 states. [2019-12-18 17:27:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:36,698 INFO L93 Difference]: Finished difference Result 877 states and 2007 transitions. [2019-12-18 17:27:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:27:36,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 17:27:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:36,701 INFO L225 Difference]: With dead ends: 877 [2019-12-18 17:27:36,701 INFO L226 Difference]: Without dead ends: 877 [2019-12-18 17:27:36,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-18 17:27:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 642. [2019-12-18 17:27:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-18 17:27:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-18 17:27:36,710 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 56 [2019-12-18 17:27:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:36,711 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-18 17:27:36,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-18 17:27:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:27:36,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:36,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:36,712 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:36,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:36,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 2 times [2019-12-18 17:27:36,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:36,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951579475] [2019-12-18 17:27:36,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:36,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951579475] [2019-12-18 17:27:36,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:36,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:36,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858426158] [2019-12-18 17:27:36,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:36,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:36,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:36,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:36,783 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 3 states. [2019-12-18 17:27:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:36,797 INFO L93 Difference]: Finished difference Result 642 states and 1440 transitions. [2019-12-18 17:27:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:36,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:27:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:36,799 INFO L225 Difference]: With dead ends: 642 [2019-12-18 17:27:36,799 INFO L226 Difference]: Without dead ends: 642 [2019-12-18 17:27:36,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-18 17:27:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2019-12-18 17:27:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 17:27:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-18 17:27:36,807 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-18 17:27:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:36,807 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-18 17:27:36,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-18 17:27:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:36,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:36,808 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-18 17:27:36,809 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-18 17:27:36,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:36,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435136442] [2019-12-18 17:27:36,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:36,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435136442] [2019-12-18 17:27:36,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:36,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:36,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116411435] [2019-12-18 17:27:36,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:27:36,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:36,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:27:36,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:36,959 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 6 states. [2019-12-18 17:27:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:37,028 INFO L93 Difference]: Finished difference Result 882 states and 1825 transitions. [2019-12-18 17:27:37,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:27:37,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 17:27:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:37,031 INFO L225 Difference]: With dead ends: 882 [2019-12-18 17:27:37,031 INFO L226 Difference]: Without dead ends: 544 [2019-12-18 17:27:37,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-18 17:27:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-12-18 17:27:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-18 17:27:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-18 17:27:37,040 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-18 17:27:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:37,040 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-18 17:27:37,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:27:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-18 17:27:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:37,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:37,042 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-18 17:27:37,042 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-18 17:27:37,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:37,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100700628] [2019-12-18 17:27:37,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:37,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100700628] [2019-12-18 17:27:37,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:37,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 17:27:37,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012965208] [2019-12-18 17:27:37,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 17:27:37,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:37,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 17:27:37,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:27:37,652 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 19 states. [2019-12-18 17:27:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:39,140 INFO L93 Difference]: Finished difference Result 1305 states and 2899 transitions. [2019-12-18 17:27:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:27:39,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 17:27:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:39,143 INFO L225 Difference]: With dead ends: 1305 [2019-12-18 17:27:39,143 INFO L226 Difference]: Without dead ends: 1275 [2019-12-18 17:27:39,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 17:27:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-18 17:27:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 726. [2019-12-18 17:27:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-12-18 17:27:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1575 transitions. [2019-12-18 17:27:39,154 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1575 transitions. Word has length 57 [2019-12-18 17:27:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:39,154 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1575 transitions. [2019-12-18 17:27:39,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 17:27:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1575 transitions. [2019-12-18 17:27:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:39,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:39,156 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-18 17:27:39,156 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-18 17:27:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash -495942269, now seen corresponding path program 3 times [2019-12-18 17:27:39,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:39,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977131521] [2019-12-18 17:27:39,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:39,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977131521] [2019-12-18 17:27:39,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:39,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:27:39,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141632206] [2019-12-18 17:27:39,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:27:39,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:39,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:27:39,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:27:39,456 INFO L87 Difference]: Start difference. First operand 726 states and 1575 transitions. Second operand 14 states. [2019-12-18 17:27:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:40,103 INFO L93 Difference]: Finished difference Result 1172 states and 2548 transitions. [2019-12-18 17:27:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:27:40,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 17:27:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:40,105 INFO L225 Difference]: With dead ends: 1172 [2019-12-18 17:27:40,105 INFO L226 Difference]: Without dead ends: 1142 [2019-12-18 17:27:40,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:27:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-12-18 17:27:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 786. [2019-12-18 17:27:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-12-18 17:27:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1721 transitions. [2019-12-18 17:27:40,117 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1721 transitions. Word has length 57 [2019-12-18 17:27:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:40,117 INFO L462 AbstractCegarLoop]: Abstraction has 786 states and 1721 transitions. [2019-12-18 17:27:40,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:27:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1721 transitions. [2019-12-18 17:27:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:40,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:40,118 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-18 17:27:40,119 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:40,119 INFO L82 PathProgramCache]: Analyzing trace with hash 60491955, now seen corresponding path program 4 times [2019-12-18 17:27:40,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:40,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979797095] [2019-12-18 17:27:40,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:40,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979797095] [2019-12-18 17:27:40,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:40,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:27:40,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643211849] [2019-12-18 17:27:40,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:27:40,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:40,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:27:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:27:40,397 INFO L87 Difference]: Start difference. First operand 786 states and 1721 transitions. Second operand 14 states. [2019-12-18 17:27:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:41,067 INFO L93 Difference]: Finished difference Result 1160 states and 2516 transitions. [2019-12-18 17:27:41,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:27:41,068 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 17:27:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:41,069 INFO L225 Difference]: With dead ends: 1160 [2019-12-18 17:27:41,069 INFO L226 Difference]: Without dead ends: 1130 [2019-12-18 17:27:41,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:27:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-12-18 17:27:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 782. [2019-12-18 17:27:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 17:27:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1711 transitions. [2019-12-18 17:27:41,079 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1711 transitions. Word has length 57 [2019-12-18 17:27:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:41,079 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1711 transitions. [2019-12-18 17:27:41,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:27:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1711 transitions. [2019-12-18 17:27:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:41,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:41,081 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-18 17:27:41,081 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 5 times [2019-12-18 17:27:41,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:41,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602517783] [2019-12-18 17:27:41,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:27:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:27:41,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:27:41,187 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:27:41,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1120~0.base_27|) (= v_~y$w_buff1_used~0_304 0) (= 0 |v_ULTIMATE.start_main_~#t1120~0.offset_21|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27|) |v_ULTIMATE.start_main_~#t1120~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= v_~a~0_57 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27|) 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1120~0.base_27| 4) |v_#length_19|) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= (store .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27| 1) |v_#valid_54|) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_~#t1120~0.offset=|v_ULTIMATE.start_main_~#t1120~0.offset_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_16|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_~#t1120~0.base=|v_ULTIMATE.start_main_~#t1120~0.base_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1121~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1122~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1120~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1122~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1120~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1121~0.offset, 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-18 17:27:41,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9| 1) |v_#valid_27|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9|) |v_ULTIMATE.start_main_~#t1121~0.offset_8| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t1121~0.offset_8|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1121~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1121~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1121~0.base_9| 0)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1121~0.offset, ULTIMATE.start_main_~#t1121~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 17:27:41,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1122~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t1122~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10|) |v_ULTIMATE.start_main_~#t1122~0.offset_10| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1122~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1122~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1122~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:27:41,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~__unbuffered_p2_EAX~0_Out719200686 ~z~0_Out719200686) (= ~y$r_buff0_thd3~0_Out719200686 1) (= ~y$r_buff0_thd1~0_In719200686 ~y$r_buff1_thd1~0_Out719200686) (= ~y$r_buff0_thd3~0_In719200686 ~y$r_buff1_thd3~0_Out719200686) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In719200686 0)) (= ~y$r_buff1_thd2~0_Out719200686 ~y$r_buff0_thd2~0_In719200686) (= 1 ~z~0_Out719200686) (= ~y$r_buff0_thd0~0_In719200686 ~y$r_buff1_thd0~0_Out719200686) (= ~__unbuffered_p2_EBX~0_Out719200686 ~a~0_In719200686)) InVars {~a~0=~a~0_In719200686, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In719200686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719200686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In719200686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In719200686, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In719200686} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out719200686, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In719200686, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out719200686, ~a~0=~a~0_In719200686, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out719200686, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out719200686, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out719200686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719200686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In719200686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In719200686, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out719200686, ~z~0=~z~0_Out719200686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out719200686} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:27:41,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 17:27:41,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In642290425 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In642290425 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite4_Out642290425| |P1Thread1of1ForFork0_#t~ite3_Out642290425|))) (or (and (= ~y~0_In642290425 |P1Thread1of1ForFork0_#t~ite3_Out642290425|) (or .cse0 .cse1) .cse2) (and (= ~y$w_buff1~0_In642290425 |P1Thread1of1ForFork0_#t~ite3_Out642290425|) (not .cse1) (not .cse0) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In642290425, ~y$w_buff1~0=~y$w_buff1~0_In642290425, ~y~0=~y~0_In642290425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642290425} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In642290425, ~y$w_buff1~0=~y$w_buff1~0_In642290425, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out642290425|, ~y~0=~y~0_In642290425, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out642290425|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642290425} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:27:41,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-595031217 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-595031217 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-595031217| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-595031217 |P2Thread1of1ForFork1_#t~ite11_Out-595031217|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-595031217, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-595031217} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-595031217, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-595031217|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-595031217} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:27:41,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1725546744 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1725546744 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1725546744 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1725546744 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite12_Out-1725546744|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1725546744 |P2Thread1of1ForFork1_#t~ite12_Out-1725546744|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1725546744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1725546744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1725546744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1725546744} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1725546744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1725546744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1725546744, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1725546744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1725546744} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:27:41,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1401527786 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1401527786 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In1401527786 ~y$r_buff0_thd3~0_Out1401527786)) (and (= 0 ~y$r_buff0_thd3~0_Out1401527786) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1401527786, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1401527786} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1401527786|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1401527786, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1401527786} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:27:41,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-379319578 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-379319578 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-379319578 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-379319578 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite14_Out-379319578| ~y$r_buff1_thd3~0_In-379319578)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite14_Out-379319578| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-379319578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-379319578, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-379319578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-379319578} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-379319578|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-379319578, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-379319578, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-379319578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-379319578} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:27:41,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 17:27:41,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1321669729 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1321669729 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1321669729|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1321669729 |P1Thread1of1ForFork0_#t~ite5_Out1321669729|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1321669729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1321669729} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1321669729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1321669729, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1321669729|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:27:41,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In2138072958 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In2138072958 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In2138072958 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2138072958 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2138072958 |P1Thread1of1ForFork0_#t~ite6_Out2138072958|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out2138072958|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2138072958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2138072958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2138072958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2138072958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2138072958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2138072958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2138072958, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out2138072958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2138072958} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:27:41,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-59984649 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-59984649 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-59984649| ~y$r_buff0_thd2~0_In-59984649)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-59984649| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-59984649, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-59984649} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-59984649, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-59984649, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-59984649|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:27:41,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In670993497 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In670993497 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In670993497 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In670993497 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite8_Out670993497| ~y$r_buff1_thd2~0_In670993497)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out670993497| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In670993497, ~y$w_buff0_used~0=~y$w_buff0_used~0_In670993497, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In670993497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670993497} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In670993497, ~y$w_buff0_used~0=~y$w_buff0_used~0_In670993497, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In670993497, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out670993497|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670993497} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:27:41,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 17:27:41,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:27:41,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-908365916 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out-908365916| |ULTIMATE.start_main_#t~ite19_Out-908365916|)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-908365916 256)))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out-908365916| ~y~0_In-908365916) (or .cse0 .cse1) .cse2) (and (not .cse1) (= ~y$w_buff1~0_In-908365916 |ULTIMATE.start_main_#t~ite18_Out-908365916|) .cse2 (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-908365916, ~y~0=~y~0_In-908365916, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-908365916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908365916} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-908365916, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-908365916|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-908365916|, ~y~0=~y~0_In-908365916, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-908365916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-908365916} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:27:41,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1873165839 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1873165839 256)))) (or (and (= ~y$w_buff0_used~0_In-1873165839 |ULTIMATE.start_main_#t~ite20_Out-1873165839|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1873165839|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1873165839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1873165839} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1873165839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1873165839, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1873165839|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:27:41,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1497367153 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1497367153 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1497367153 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1497367153 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1497367153| ~y$w_buff1_used~0_In-1497367153) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1497367153| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497367153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1497367153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1497367153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497367153} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497367153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1497367153, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1497367153|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1497367153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497367153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:27:41,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-63676668 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-63676668 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-63676668| ~y$r_buff0_thd0~0_In-63676668) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-63676668| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-63676668, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-63676668} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-63676668, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-63676668, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-63676668|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:27:41,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1478266112 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1478266112 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1478266112 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1478266112 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite23_Out1478266112| ~y$r_buff1_thd0~0_In1478266112)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out1478266112| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1478266112, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1478266112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1478266112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478266112} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1478266112, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1478266112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1478266112, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1478266112|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478266112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:27:41,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1149227264 256)))) (or (and (= ~y$w_buff0~0_In-1149227264 |ULTIMATE.start_main_#t~ite29_Out-1149227264|) (= |ULTIMATE.start_main_#t~ite30_Out-1149227264| |ULTIMATE.start_main_#t~ite29_Out-1149227264|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1149227264 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1149227264 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-1149227264 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1149227264 256)))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out-1149227264| ~y$w_buff0~0_In-1149227264) (= |ULTIMATE.start_main_#t~ite29_In-1149227264| |ULTIMATE.start_main_#t~ite29_Out-1149227264|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149227264, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1149227264|, ~y$w_buff0~0=~y$w_buff0~0_In-1149227264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149227264, ~weak$$choice2~0=~weak$$choice2~0_In-1149227264, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149227264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149227264} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1149227264|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149227264, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1149227264|, ~y$w_buff0~0=~y$w_buff0~0_In-1149227264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149227264, ~weak$$choice2~0=~weak$$choice2~0_In-1149227264, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1149227264, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149227264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:27:41,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-742463499 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-742463499| ~y$w_buff0_used~0_In-742463499) (= |ULTIMATE.start_main_#t~ite35_In-742463499| |ULTIMATE.start_main_#t~ite35_Out-742463499|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite35_Out-742463499| ~y$w_buff0_used~0_In-742463499) (= |ULTIMATE.start_main_#t~ite35_Out-742463499| |ULTIMATE.start_main_#t~ite36_Out-742463499|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-742463499 256)))) (or (= (mod ~y$w_buff0_used~0_In-742463499 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In-742463499 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-742463499 256)) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-742463499, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-742463499, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-742463499|, ~weak$$choice2~0=~weak$$choice2~0_In-742463499, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-742463499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-742463499} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-742463499, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-742463499, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-742463499|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-742463499|, ~weak$$choice2~0=~weak$$choice2~0_In-742463499, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-742463499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-742463499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:27:41,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1049801318 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1049801318 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1049801318 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In1049801318 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1049801318 256))))) .cse1 (= ~y$w_buff1_used~0_In1049801318 |ULTIMATE.start_main_#t~ite38_Out1049801318|) (= |ULTIMATE.start_main_#t~ite38_Out1049801318| |ULTIMATE.start_main_#t~ite39_Out1049801318|)) (and (not .cse1) (= ~y$w_buff1_used~0_In1049801318 |ULTIMATE.start_main_#t~ite39_Out1049801318|) (= |ULTIMATE.start_main_#t~ite38_In1049801318| |ULTIMATE.start_main_#t~ite38_Out1049801318|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1049801318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1049801318, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1049801318|, ~weak$$choice2~0=~weak$$choice2~0_In1049801318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1049801318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1049801318} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1049801318, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1049801318|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1049801318, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1049801318|, ~weak$$choice2~0=~weak$$choice2~0_In1049801318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1049801318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1049801318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:27:41,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:27:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In42487028 256)))) (or (and (= ~y$r_buff1_thd0~0_In42487028 |ULTIMATE.start_main_#t~ite44_Out42487028|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In42487028 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In42487028 256))) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In42487028 256) 0)) (= (mod ~y$w_buff0_used~0_In42487028 256) 0))) .cse1 (= |ULTIMATE.start_main_#t~ite45_Out42487028| |ULTIMATE.start_main_#t~ite44_Out42487028|)) (and (= |ULTIMATE.start_main_#t~ite44_In42487028| |ULTIMATE.start_main_#t~ite44_Out42487028|) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out42487028| ~y$r_buff1_thd0~0_In42487028)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In42487028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In42487028, ~weak$$choice2~0=~weak$$choice2~0_In42487028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In42487028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In42487028, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In42487028|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In42487028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In42487028, ~weak$$choice2~0=~weak$$choice2~0_In42487028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In42487028, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out42487028|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out42487028|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In42487028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:27:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:27:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:27:41,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:27:41 BasicIcfg [2019-12-18 17:27:41,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:27:41,303 INFO L168 Benchmark]: Toolchain (without parser) took 28531.14 ms. Allocated memory was 144.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 99.1 MB in the beginning and 926.0 MB in the end (delta: -827.0 MB). Peak memory consumption was 305.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:41,304 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:27:41,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.89 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.9 MB in the beginning and 155.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:41,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:41,305 INFO L168 Benchmark]: Boogie Preprocessor took 39.42 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:41,306 INFO L168 Benchmark]: RCFGBuilder took 828.56 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 102.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:41,307 INFO L168 Benchmark]: TraceAbstraction took 26752.43 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 102.3 MB in the beginning and 926.0 MB in the end (delta: -823.8 MB). Peak memory consumption was 251.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:41,310 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.45 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.89 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.9 MB in the beginning and 155.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.42 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.56 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 102.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26752.43 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 102.3 MB in the beginning and 926.0 MB in the end (delta: -823.8 MB). Peak memory consumption was 251.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1986 SDtfs, 2366 SDslu, 5319 SDs, 0 SdLazy, 3626 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 20 SyntacticMatches, 12 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31188occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 30577 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 120199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...