/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/mix039_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:26:56,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:26:56,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:26:56,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:26:56,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:26:56,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:26:56,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:26:56,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:26:56,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:26:56,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:26:56,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:26:56,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:26:56,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:26:56,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:26:56,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:26:56,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:26:56,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:26:56,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:26:56,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:26:56,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:26:56,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:26:56,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:26:56,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:26:56,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:26:56,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:26:56,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:26:56,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:26:56,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:26:56,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:26:56,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:26:56,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:26:56,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:26:56,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:26:56,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:26:56,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:26:56,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:26:56,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:26:56,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:26:56,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:26:56,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:26:56,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:26:56,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:26:56,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:26:56,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:26:56,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:26:56,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:26:56,564 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:26:56,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:26:56,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:26:56,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:26:56,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:26:56,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:26:56,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:26:56,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:26:56,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:26:56,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:26:56,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:26:56,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:26:56,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:26:56,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:26:56,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:26:56,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:26:56,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:26:56,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:26:56,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:26:56,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:26:56,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:26:56,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:26:56,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:26:56,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:26:56,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:26:56,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:26:56,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:26:56,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:26:56,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:26:56,862 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:26:56,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_pso.opt.i [2019-12-27 02:26:56,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d282a47/01f75e4f761d40eb99a74ebaa08aa216/FLAG77f38e373 [2019-12-27 02:26:57,459 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:26:57,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_pso.opt.i [2019-12-27 02:26:57,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d282a47/01f75e4f761d40eb99a74ebaa08aa216/FLAG77f38e373 [2019-12-27 02:26:57,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d282a47/01f75e4f761d40eb99a74ebaa08aa216 [2019-12-27 02:26:57,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:26:57,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:26:57,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:26:57,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:26:57,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:26:57,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:26:57" (1/1) ... [2019-12-27 02:26:57,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562bdfeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:57, skipping insertion in model container [2019-12-27 02:26:57,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:26:57" (1/1) ... [2019-12-27 02:26:57,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:26:57,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:26:58,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:26:58,359 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:26:58,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:26:58,505 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:26:58,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58 WrapperNode [2019-12-27 02:26:58,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:26:58,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:26:58,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:26:58,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:26:58,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:26:58,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:26:58,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:26:58,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:26:58,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... [2019-12-27 02:26:58,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:26:58,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:26:58,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:26:58,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:26:58,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:26:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:26:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:26:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:26:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:26:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:26:58,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:26:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:26:58,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:26:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:26:58,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:26:58,677 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:26:58,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:26:58,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:26:58,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:26:58,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:26:58,682 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:26:59,392 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:26:59,393 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:26:59,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:26:59 BoogieIcfgContainer [2019-12-27 02:26:59,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:26:59,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:26:59,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:26:59,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:26:59,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:26:57" (1/3) ... [2019-12-27 02:26:59,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7a041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:26:59, skipping insertion in model container [2019-12-27 02:26:59,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:26:58" (2/3) ... [2019-12-27 02:26:59,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7a041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:26:59, skipping insertion in model container [2019-12-27 02:26:59,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:26:59" (3/3) ... [2019-12-27 02:26:59,403 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_pso.opt.i [2019-12-27 02:26:59,414 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:26:59,415 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:26:59,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:26:59,427 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:26:59,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,496 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,496 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,550 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,550 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,550 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,573 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,574 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,575 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,578 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:26:59,593 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:26:59,614 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:26:59,614 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:26:59,614 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:26:59,614 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:26:59,614 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:26:59,615 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:26:59,615 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:26:59,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:26:59,632 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 02:26:59,634 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:26:59,728 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:26:59,729 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:26:59,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:26:59,763 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:26:59,814 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:26:59,814 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:26:59,821 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:26:59,837 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:26:59,839 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:27:04,629 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:27:04,731 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:27:05,224 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:27:05,371 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:27:05,390 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 02:27:05,390 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 02:27:05,394 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 02:27:06,620 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 02:27:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 02:27:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:27:06,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:06,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:06,630 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 02:27:06,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:06,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646936103] [2019-12-27 02:27:06,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:06,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646936103] [2019-12-27 02:27:06,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:06,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:27:06,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565105631] [2019-12-27 02:27:06,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:06,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:06,975 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 02:27:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:08,164 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 02:27:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:08,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:27:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:08,441 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 02:27:08,442 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 02:27:08,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 02:27:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 02:27:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 02:27:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 02:27:09,477 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 02:27:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:09,478 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 02:27:09,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 02:27:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:27:09,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:09,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:09,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 02:27:09,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:09,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185881870] [2019-12-27 02:27:09,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:09,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185881870] [2019-12-27 02:27:09,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:09,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:27:09,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600292290] [2019-12-27 02:27:09,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:27:09,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:09,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:27:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:27:09,695 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 02:27:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:11,605 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 02:27:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:27:11,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:27:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:11,770 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 02:27:11,770 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 02:27:11,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 02:27:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 02:27:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 02:27:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 02:27:12,879 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 02:27:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:12,880 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 02:27:12,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:27:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 02:27:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:27:12,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:12,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:12,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 02:27:12,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:12,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751713692] [2019-12-27 02:27:12,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:13,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751713692] [2019-12-27 02:27:13,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:13,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:27:13,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369988259] [2019-12-27 02:27:13,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:27:13,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:13,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:27:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:27:13,025 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-27 02:27:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:14,667 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 02:27:14,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:27:14,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:27:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:14,851 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 02:27:14,851 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 02:27:14,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 02:27:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 02:27:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 02:27:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 02:27:16,044 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 02:27:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:16,045 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 02:27:16,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:27:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 02:27:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 02:27:16,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:16,058 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] [2019-12-27 02:27:16,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 02:27:16,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:16,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392500740] [2019-12-27 02:27:16,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:16,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392500740] [2019-12-27 02:27:16,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:16,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:27:16,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003932748] [2019-12-27 02:27:16,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:16,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:16,105 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 02:27:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:16,246 INFO L93 Difference]: Finished difference Result 30328 states and 126949 transitions. [2019-12-27 02:27:16,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:16,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 02:27:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:16,354 INFO L225 Difference]: With dead ends: 30328 [2019-12-27 02:27:16,355 INFO L226 Difference]: Without dead ends: 30328 [2019-12-27 02:27:16,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-27 02:27:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30328. [2019-12-27 02:27:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-27 02:27:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 126949 transitions. [2019-12-27 02:27:17,684 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 126949 transitions. Word has length 20 [2019-12-27 02:27:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:17,684 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 126949 transitions. [2019-12-27 02:27:17,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 126949 transitions. [2019-12-27 02:27:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:27:17,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:17,698 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] [2019-12-27 02:27:17,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 02:27:17,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:17,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703575477] [2019-12-27 02:27:17,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:17,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703575477] [2019-12-27 02:27:17,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:17,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:27:17,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121189198] [2019-12-27 02:27:17,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:17,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:17,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:17,747 INFO L87 Difference]: Start difference. First operand 30328 states and 126949 transitions. Second operand 3 states. [2019-12-27 02:27:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:18,341 INFO L93 Difference]: Finished difference Result 44924 states and 179717 transitions. [2019-12-27 02:27:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:18,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:27:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:18,436 INFO L225 Difference]: With dead ends: 44924 [2019-12-27 02:27:18,437 INFO L226 Difference]: Without dead ends: 32296 [2019-12-27 02:27:18,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2019-12-27 02:27:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 31012. [2019-12-27 02:27:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31012 states. [2019-12-27 02:27:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31012 states to 31012 states and 116299 transitions. [2019-12-27 02:27:21,189 INFO L78 Accepts]: Start accepts. Automaton has 31012 states and 116299 transitions. Word has length 21 [2019-12-27 02:27:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:21,189 INFO L462 AbstractCegarLoop]: Abstraction has 31012 states and 116299 transitions. [2019-12-27 02:27:21,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 31012 states and 116299 transitions. [2019-12-27 02:27:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:27:21,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:21,201 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] [2019-12-27 02:27:21,201 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1131875471, now seen corresponding path program 1 times [2019-12-27 02:27:21,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:21,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683790405] [2019-12-27 02:27:21,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:21,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683790405] [2019-12-27 02:27:21,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:21,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:27:21,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038013122] [2019-12-27 02:27:21,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:21,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:21,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:21,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:21,245 INFO L87 Difference]: Start difference. First operand 31012 states and 116299 transitions. Second operand 3 states. [2019-12-27 02:27:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:21,394 INFO L93 Difference]: Finished difference Result 30604 states and 114575 transitions. [2019-12-27 02:27:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:21,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:27:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:21,461 INFO L225 Difference]: With dead ends: 30604 [2019-12-27 02:27:21,461 INFO L226 Difference]: Without dead ends: 30604 [2019-12-27 02:27:21,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30604 states. [2019-12-27 02:27:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30604 to 30436. [2019-12-27 02:27:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30436 states. [2019-12-27 02:27:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 114095 transitions. [2019-12-27 02:27:22,283 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 114095 transitions. Word has length 21 [2019-12-27 02:27:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:22,284 INFO L462 AbstractCegarLoop]: Abstraction has 30436 states and 114095 transitions. [2019-12-27 02:27:22,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 114095 transitions. [2019-12-27 02:27:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:27:22,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:22,298 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] [2019-12-27 02:27:22,298 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:22,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1107033684, now seen corresponding path program 1 times [2019-12-27 02:27:22,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:22,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533299330] [2019-12-27 02:27:22,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:22,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533299330] [2019-12-27 02:27:22,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:22,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:27:22,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638127046] [2019-12-27 02:27:22,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:22,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:22,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:22,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:22,348 INFO L87 Difference]: Start difference. First operand 30436 states and 114095 transitions. Second operand 3 states. [2019-12-27 02:27:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:22,495 INFO L93 Difference]: Finished difference Result 30436 states and 112751 transitions. [2019-12-27 02:27:22,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:22,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 02:27:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:22,560 INFO L225 Difference]: With dead ends: 30436 [2019-12-27 02:27:22,560 INFO L226 Difference]: Without dead ends: 30436 [2019-12-27 02:27:22,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30436 states. [2019-12-27 02:27:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30436 to 30036. [2019-12-27 02:27:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30036 states. [2019-12-27 02:27:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30036 states to 30036 states and 111391 transitions. [2019-12-27 02:27:23,534 INFO L78 Accepts]: Start accepts. Automaton has 30036 states and 111391 transitions. Word has length 22 [2019-12-27 02:27:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:23,535 INFO L462 AbstractCegarLoop]: Abstraction has 30036 states and 111391 transitions. [2019-12-27 02:27:23,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 30036 states and 111391 transitions. [2019-12-27 02:27:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:27:23,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:23,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:23,547 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash -428330177, now seen corresponding path program 1 times [2019-12-27 02:27:23,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:23,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212101462] [2019-12-27 02:27:23,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:23,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212101462] [2019-12-27 02:27:23,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:23,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:27:23,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945614170] [2019-12-27 02:27:23,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:27:23,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:23,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:27:23,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:27:23,619 INFO L87 Difference]: Start difference. First operand 30036 states and 111391 transitions. Second operand 4 states. [2019-12-27 02:27:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:23,750 INFO L93 Difference]: Finished difference Result 25667 states and 89340 transitions. [2019-12-27 02:27:23,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:27:23,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 02:27:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:23,796 INFO L225 Difference]: With dead ends: 25667 [2019-12-27 02:27:23,796 INFO L226 Difference]: Without dead ends: 23877 [2019-12-27 02:27:23,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23877 states. [2019-12-27 02:27:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23877 to 23877. [2019-12-27 02:27:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23877 states. [2019-12-27 02:27:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23877 states to 23877 states and 83947 transitions. [2019-12-27 02:27:24,200 INFO L78 Accepts]: Start accepts. Automaton has 23877 states and 83947 transitions. Word has length 23 [2019-12-27 02:27:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:24,200 INFO L462 AbstractCegarLoop]: Abstraction has 23877 states and 83947 transitions. [2019-12-27 02:27:24,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:27:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 23877 states and 83947 transitions. [2019-12-27 02:27:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:27:24,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:24,210 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] [2019-12-27 02:27:24,210 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1442998109, now seen corresponding path program 1 times [2019-12-27 02:27:24,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:24,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13860488] [2019-12-27 02:27:24,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:24,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13860488] [2019-12-27 02:27:24,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:24,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:27:24,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564364133] [2019-12-27 02:27:24,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:27:24,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:27:24,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:27:24,257 INFO L87 Difference]: Start difference. First operand 23877 states and 83947 transitions. Second operand 4 states. [2019-12-27 02:27:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:24,415 INFO L93 Difference]: Finished difference Result 34038 states and 116336 transitions. [2019-12-27 02:27:24,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:27:24,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 02:27:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:24,716 INFO L225 Difference]: With dead ends: 34038 [2019-12-27 02:27:24,716 INFO L226 Difference]: Without dead ends: 21154 [2019-12-27 02:27:24,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21154 states. [2019-12-27 02:27:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21154 to 20871. [2019-12-27 02:27:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20871 states. [2019-12-27 02:27:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20871 states to 20871 states and 73508 transitions. [2019-12-27 02:27:25,078 INFO L78 Accepts]: Start accepts. Automaton has 20871 states and 73508 transitions. Word has length 24 [2019-12-27 02:27:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:25,078 INFO L462 AbstractCegarLoop]: Abstraction has 20871 states and 73508 transitions. [2019-12-27 02:27:25,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:27:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20871 states and 73508 transitions. [2019-12-27 02:27:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:27:25,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:25,087 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] [2019-12-27 02:27:25,087 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:25,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1161161883, now seen corresponding path program 1 times [2019-12-27 02:27:25,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:25,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923585397] [2019-12-27 02:27:25,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:25,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923585397] [2019-12-27 02:27:25,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:25,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:27:25,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459809718] [2019-12-27 02:27:25,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:27:25,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:27:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:25,166 INFO L87 Difference]: Start difference. First operand 20871 states and 73508 transitions. Second operand 5 states. [2019-12-27 02:27:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:25,287 INFO L93 Difference]: Finished difference Result 9585 states and 29775 transitions. [2019-12-27 02:27:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:27:25,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 02:27:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:25,308 INFO L225 Difference]: With dead ends: 9585 [2019-12-27 02:27:25,309 INFO L226 Difference]: Without dead ends: 8268 [2019-12-27 02:27:25,309 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-27 02:27:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2019-12-27 02:27:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 8268. [2019-12-27 02:27:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8268 states. [2019-12-27 02:27:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 25567 transitions. [2019-12-27 02:27:25,526 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 25567 transitions. Word has length 24 [2019-12-27 02:27:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:25,527 INFO L462 AbstractCegarLoop]: Abstraction has 8268 states and 25567 transitions. [2019-12-27 02:27:25,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:27:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 25567 transitions. [2019-12-27 02:27:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:27:25,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:25,534 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] [2019-12-27 02:27:25,534 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1743073835, now seen corresponding path program 1 times [2019-12-27 02:27:25,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:25,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134108337] [2019-12-27 02:27:25,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:25,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134108337] [2019-12-27 02:27:25,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:25,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:27:25,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517779913] [2019-12-27 02:27:25,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:27:25,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:25,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:27:25,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:27:25,593 INFO L87 Difference]: Start difference. First operand 8268 states and 25567 transitions. Second operand 4 states. [2019-12-27 02:27:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:25,664 INFO L93 Difference]: Finished difference Result 12230 states and 37956 transitions. [2019-12-27 02:27:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:27:25,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:27:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:25,688 INFO L225 Difference]: With dead ends: 12230 [2019-12-27 02:27:25,689 INFO L226 Difference]: Without dead ends: 7682 [2019-12-27 02:27:25,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-12-27 02:27:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7209. [2019-12-27 02:27:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-12-27 02:27:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 21269 transitions. [2019-12-27 02:27:25,845 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 21269 transitions. Word has length 25 [2019-12-27 02:27:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:25,846 INFO L462 AbstractCegarLoop]: Abstraction has 7209 states and 21269 transitions. [2019-12-27 02:27:25,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:27:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 21269 transitions. [2019-12-27 02:27:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:27:25,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:25,851 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] [2019-12-27 02:27:25,852 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash -82285579, now seen corresponding path program 2 times [2019-12-27 02:27:25,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:25,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873893026] [2019-12-27 02:27:25,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:25,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873893026] [2019-12-27 02:27:25,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:25,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:27:25,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922188265] [2019-12-27 02:27:25,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:27:25,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:25,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:27:25,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:27:25,989 INFO L87 Difference]: Start difference. First operand 7209 states and 21269 transitions. Second operand 6 states. [2019-12-27 02:27:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:26,092 INFO L93 Difference]: Finished difference Result 2913 states and 7585 transitions. [2019-12-27 02:27:26,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:27:26,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 02:27:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:26,097 INFO L225 Difference]: With dead ends: 2913 [2019-12-27 02:27:26,097 INFO L226 Difference]: Without dead ends: 2472 [2019-12-27 02:27:26,097 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-27 02:27:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-12-27 02:27:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-12-27 02:27:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-27 02:27:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 6301 transitions. [2019-12-27 02:27:26,134 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 6301 transitions. Word has length 25 [2019-12-27 02:27:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:26,135 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 6301 transitions. [2019-12-27 02:27:26,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:27:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 6301 transitions. [2019-12-27 02:27:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:27:26,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:26,139 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] [2019-12-27 02:27:26,139 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 02:27:26,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:26,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212520576] [2019-12-27 02:27:26,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:26,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212520576] [2019-12-27 02:27:26,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:26,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:27:26,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010795593] [2019-12-27 02:27:26,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:26,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:26,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:26,174 INFO L87 Difference]: Start difference. First operand 2472 states and 6301 transitions. Second operand 3 states. [2019-12-27 02:27:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:26,226 INFO L93 Difference]: Finished difference Result 3752 states and 9516 transitions. [2019-12-27 02:27:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:26,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:27:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:26,233 INFO L225 Difference]: With dead ends: 3752 [2019-12-27 02:27:26,234 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 02:27:26,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 02:27:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2928. [2019-12-27 02:27:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-27 02:27:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 7542 transitions. [2019-12-27 02:27:26,289 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 7542 transitions. Word has length 32 [2019-12-27 02:27:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:26,290 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 7542 transitions. [2019-12-27 02:27:26,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 7542 transitions. [2019-12-27 02:27:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:27:26,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:26,295 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] [2019-12-27 02:27:26,296 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 02:27:26,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:26,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121195490] [2019-12-27 02:27:26,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:26,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121195490] [2019-12-27 02:27:26,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:26,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:27:26,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776298921] [2019-12-27 02:27:26,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:27:26,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:26,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:27:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:27:26,369 INFO L87 Difference]: Start difference. First operand 2928 states and 7542 transitions. Second operand 6 states. [2019-12-27 02:27:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:26,854 INFO L93 Difference]: Finished difference Result 5425 states and 13386 transitions. [2019-12-27 02:27:26,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:27:26,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 02:27:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:26,862 INFO L225 Difference]: With dead ends: 5425 [2019-12-27 02:27:26,862 INFO L226 Difference]: Without dead ends: 5242 [2019-12-27 02:27:26,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:27:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2019-12-27 02:27:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2952. [2019-12-27 02:27:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-27 02:27:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 7548 transitions. [2019-12-27 02:27:26,908 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 7548 transitions. Word has length 32 [2019-12-27 02:27:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:26,908 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 7548 transitions. [2019-12-27 02:27:26,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:27:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 7548 transitions. [2019-12-27 02:27:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:27:26,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:26,912 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-27 02:27:26,912 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:26,912 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 02:27:26,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:26,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093633974] [2019-12-27 02:27:26,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:26,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093633974] [2019-12-27 02:27:26,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:26,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:27:26,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462895138] [2019-12-27 02:27:26,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:27:26,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:27:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:27:26,997 INFO L87 Difference]: Start difference. First operand 2952 states and 7548 transitions. Second operand 6 states. [2019-12-27 02:27:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:27,466 INFO L93 Difference]: Finished difference Result 5331 states and 12930 transitions. [2019-12-27 02:27:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:27:27,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:27:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:27,480 INFO L225 Difference]: With dead ends: 5331 [2019-12-27 02:27:27,480 INFO L226 Difference]: Without dead ends: 5133 [2019-12-27 02:27:27,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:27:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-12-27 02:27:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 2837. [2019-12-27 02:27:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-27 02:27:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 7139 transitions. [2019-12-27 02:27:27,523 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 7139 transitions. Word has length 33 [2019-12-27 02:27:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:27,523 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 7139 transitions. [2019-12-27 02:27:27,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:27:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 7139 transitions. [2019-12-27 02:27:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:27:27,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:27,527 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-27 02:27:27,527 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1104473775, now seen corresponding path program 1 times [2019-12-27 02:27:27,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:27,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866189541] [2019-12-27 02:27:27,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:27,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866189541] [2019-12-27 02:27:27,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:27,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:27:27,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122777434] [2019-12-27 02:27:27,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:27:27,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:27,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:27:27,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:27:27,603 INFO L87 Difference]: Start difference. First operand 2837 states and 7139 transitions. Second operand 7 states. [2019-12-27 02:27:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:27,706 INFO L93 Difference]: Finished difference Result 2153 states and 5477 transitions. [2019-12-27 02:27:27,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:27:27,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 02:27:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:27,707 INFO L225 Difference]: With dead ends: 2153 [2019-12-27 02:27:27,707 INFO L226 Difference]: Without dead ends: 476 [2019-12-27 02:27:27,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:27:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-27 02:27:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-12-27 02:27:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-12-27 02:27:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1059 transitions. [2019-12-27 02:27:27,713 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1059 transitions. Word has length 34 [2019-12-27 02:27:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:27,713 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 1059 transitions. [2019-12-27 02:27:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:27:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1059 transitions. [2019-12-27 02:27:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:27:27,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:27,715 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] [2019-12-27 02:27:27,715 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 1 times [2019-12-27 02:27:27,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:27,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948420567] [2019-12-27 02:27:27,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:27,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948420567] [2019-12-27 02:27:27,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:27,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:27:27,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896944323] [2019-12-27 02:27:27,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:27:27,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:27,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:27:27,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:27:27,790 INFO L87 Difference]: Start difference. First operand 470 states and 1059 transitions. Second operand 7 states. [2019-12-27 02:27:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:27,938 INFO L93 Difference]: Finished difference Result 892 states and 1966 transitions. [2019-12-27 02:27:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:27:27,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:27:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:27,940 INFO L225 Difference]: With dead ends: 892 [2019-12-27 02:27:27,940 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 02:27:27,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:27:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 02:27:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-27 02:27:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 02:27:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-27 02:27:27,949 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-27 02:27:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:27,950 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-27 02:27:27,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:27:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-27 02:27:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:27:27,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:27,953 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] [2019-12-27 02:27:27,953 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 2 times [2019-12-27 02:27:27,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:27,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312378942] [2019-12-27 02:27:27,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:27:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:27:28,173 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:27:28,173 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:27:28,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1037~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1037~0.base_71|) |v_ULTIMATE.start_main_~#t1037~0.offset_43| 0)) |v_#memory_int_27|) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= (select .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_71|) 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= 0 |v_ULTIMATE.start_main_~#t1037~0.offset_43|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1037~0.base_71| 4)) (= 0 v_~z$r_buff0_thd3~0_266) (= (store .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_71| 1) |v_#valid_117|) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1037~0.base_71|) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_24|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_68|, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_36|, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t1037~0.offset=|v_ULTIMATE.start_main_~#t1037~0.offset_43|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_36|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1037~0.base=|v_ULTIMATE.start_main_~#t1037~0.base_71|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_41|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1038~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1039~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1037~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1040~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1037~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1039~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1038~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:27:28,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1038~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11|) |v_ULTIMATE.start_main_~#t1038~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1038~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1038~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1038~0.offset_10|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1038~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1038~0.base, #length] because there is no mapped edge [2019-12-27 02:27:28,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1039~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1039~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12|) |v_ULTIMATE.start_main_~#t1039~0.offset_11| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1039~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1039~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1039~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1039~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:27:28,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12|) |v_ULTIMATE.start_main_~#t1040~0.offset_10| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1040~0.base_12|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1040~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1040~0.offset_10| 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1040~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1040~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:27:28,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff1_thd3~0_Out1972618272 ~z$r_buff0_thd3~0_In1972618272) (= ~__unbuffered_p3_EBX~0_Out1972618272 ~b~0_In1972618272) (= ~z$r_buff0_thd1~0_In1972618272 ~z$r_buff1_thd1~0_Out1972618272) (= ~z$r_buff1_thd2~0_Out1972618272 ~z$r_buff0_thd2~0_In1972618272) (= ~__unbuffered_p3_EAX~0_Out1972618272 ~a~0_Out1972618272) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1972618272 0)) (= ~z$r_buff1_thd0~0_Out1972618272 ~z$r_buff0_thd0~0_In1972618272) (= ~z$r_buff0_thd4~0_Out1972618272 1) (= 1 ~a~0_Out1972618272) (= ~z$r_buff0_thd4~0_In1972618272 ~z$r_buff1_thd4~0_Out1972618272)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1972618272, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1972618272, ~b~0=~b~0_In1972618272, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1972618272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1972618272, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1972618272, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1972618272} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1972618272, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1972618272, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1972618272, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1972618272, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1972618272, ~a~0=~a~0_Out1972618272, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1972618272, ~b~0=~b~0_In1972618272, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1972618272, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1972618272, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1972618272, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1972618272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1972618272, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1972618272, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1972618272} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 02:27:28,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 02:27:28,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~y~0_18 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 02:27:28,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1589086473 256) 0))) (or (and (= ~z$w_buff0~0_In1589086473 |P2Thread1of1ForFork1_#t~ite8_Out1589086473|) (= |P2Thread1of1ForFork1_#t~ite9_Out1589086473| |P2Thread1of1ForFork1_#t~ite8_Out1589086473|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1589086473 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1589086473 256)) .cse0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1589086473 256))) (= (mod ~z$w_buff0_used~0_In1589086473 256) 0))) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite8_In1589086473| |P2Thread1of1ForFork1_#t~ite8_Out1589086473|) (not .cse1) (= ~z$w_buff0~0_In1589086473 |P2Thread1of1ForFork1_#t~ite9_Out1589086473|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1589086473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1589086473, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1589086473, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1589086473, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1589086473, ~weak$$choice2~0=~weak$$choice2~0_In1589086473, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1589086473|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1589086473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1589086473, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1589086473, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1589086473, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1589086473, ~weak$$choice2~0=~weak$$choice2~0_In1589086473, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1589086473|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1589086473|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:27:28,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1464940548 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1464940548 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1464940548 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1464940548 256) 0)) (= (mod ~z$w_buff0_used~0_In1464940548 256) 0))) (= |P2Thread1of1ForFork1_#t~ite11_Out1464940548| |P2Thread1of1ForFork1_#t~ite12_Out1464940548|) (= |P2Thread1of1ForFork1_#t~ite11_Out1464940548| ~z$w_buff1~0_In1464940548)) (and (= |P2Thread1of1ForFork1_#t~ite11_In1464940548| |P2Thread1of1ForFork1_#t~ite11_Out1464940548|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1464940548| ~z$w_buff1~0_In1464940548)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1464940548, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1464940548, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1464940548|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1464940548, ~z$w_buff1~0=~z$w_buff1~0_In1464940548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1464940548, ~weak$$choice2~0=~weak$$choice2~0_In1464940548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1464940548, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1464940548|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1464940548, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1464940548|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1464940548, ~z$w_buff1~0=~z$w_buff1~0_In1464940548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1464940548, ~weak$$choice2~0=~weak$$choice2~0_In1464940548} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:27:28,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In158737898 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out158737898| ~z$w_buff0_used~0_In158737898) (= |P2Thread1of1ForFork1_#t~ite14_Out158737898| |P2Thread1of1ForFork1_#t~ite15_Out158737898|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In158737898 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In158737898 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In158737898 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In158737898 256) 0)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In158737898| |P2Thread1of1ForFork1_#t~ite14_Out158737898|) (= ~z$w_buff0_used~0_In158737898 |P2Thread1of1ForFork1_#t~ite15_Out158737898|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In158737898|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In158737898, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In158737898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158737898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In158737898, ~weak$$choice2~0=~weak$$choice2~0_In158737898} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out158737898|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out158737898|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In158737898, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In158737898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158737898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In158737898, ~weak$$choice2~0=~weak$$choice2~0_In158737898} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 02:27:28,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 02:27:28,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-604190729 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_In-604190729| |P2Thread1of1ForFork1_#t~ite23_Out-604190729|) (= |P2Thread1of1ForFork1_#t~ite24_Out-604190729| ~z$r_buff1_thd3~0_In-604190729) (not .cse0)) (and (= ~z$r_buff1_thd3~0_In-604190729 |P2Thread1of1ForFork1_#t~ite23_Out-604190729|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-604190729 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-604190729 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-604190729 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-604190729 256) 0))) (= |P2Thread1of1ForFork1_#t~ite24_Out-604190729| |P2Thread1of1ForFork1_#t~ite23_Out-604190729|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-604190729, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-604190729, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-604190729|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-604190729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-604190729, ~weak$$choice2~0=~weak$$choice2~0_In-604190729} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-604190729|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-604190729, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-604190729, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-604190729|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-604190729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-604190729, ~weak$$choice2~0=~weak$$choice2~0_In-604190729} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 02:27:28,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:27:28,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In195365973 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In195365973 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In195365973 |P3Thread1of1ForFork2_#t~ite28_Out195365973|)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out195365973|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In195365973, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In195365973} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out195365973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In195365973, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In195365973} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:27:28,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-651480700 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-651480700 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-651480700 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-651480700 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite29_Out-651480700| ~z$w_buff1_used~0_In-651480700) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork2_#t~ite29_Out-651480700| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-651480700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-651480700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-651480700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651480700} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-651480700|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-651480700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-651480700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-651480700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651480700} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:27:28,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In475198066 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In475198066 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out475198066 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out475198066 ~z$r_buff0_thd4~0_In475198066) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In475198066, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In475198066} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In475198066, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out475198066, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out475198066|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 02:27:28,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1792780172 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1792780172 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1792780172 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1792780172 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out1792780172| ~z$r_buff1_thd4~0_In1792780172)) (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out1792780172|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1792780172, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792780172, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1792780172, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792780172} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1792780172, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792780172, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1792780172, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792780172, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1792780172|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:27:28,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:27:28,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:27:28,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite37_Out798013687| |ULTIMATE.start_main_#t~ite36_Out798013687|)) (.cse2 (= (mod ~z$w_buff1_used~0_In798013687 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In798013687 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In798013687 |ULTIMATE.start_main_#t~ite36_Out798013687|)) (and .cse0 (= ~z~0_In798013687 |ULTIMATE.start_main_#t~ite36_Out798013687|) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In798013687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In798013687, ~z$w_buff1~0=~z$w_buff1~0_In798013687, ~z~0=~z~0_In798013687} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In798013687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In798013687, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out798013687|, ~z$w_buff1~0=~z$w_buff1~0_In798013687, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out798013687|, ~z~0=~z~0_In798013687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:27:28,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-168230208 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-168230208 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-168230208|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-168230208 |ULTIMATE.start_main_#t~ite38_Out-168230208|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-168230208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-168230208} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-168230208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-168230208, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-168230208|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:27:28,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1406181627 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1406181627 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1406181627 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1406181627 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-1406181627| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-1406181627| ~z$w_buff1_used~0_In-1406181627)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1406181627, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1406181627, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1406181627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406181627} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1406181627, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1406181627|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1406181627, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1406181627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406181627} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:27:28,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In70953579 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In70953579 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out70953579| ~z$r_buff0_thd0~0_In70953579)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out70953579| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In70953579, ~z$w_buff0_used~0=~z$w_buff0_used~0_In70953579} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In70953579, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out70953579|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In70953579} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:27:28,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-368735424 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-368735424 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-368735424 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-368735424 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-368735424|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-368735424 |ULTIMATE.start_main_#t~ite41_Out-368735424|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-368735424, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-368735424, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-368735424, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-368735424} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-368735424|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-368735424, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-368735424, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-368735424, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-368735424} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:27:28,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:27:28,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:27:28 BasicIcfg [2019-12-27 02:27:28,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:27:28,292 INFO L168 Benchmark]: Toolchain (without parser) took 30550.53 ms. Allocated memory was 146.3 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 101.4 MB in the beginning and 1.0 GB in the end (delta: -907.6 MB). Peak memory consumption was 691.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:28,292 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 02:27:28,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.11 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 157.5 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:28,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:28,294 INFO L168 Benchmark]: Boogie Preprocessor took 39.23 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:28,295 INFO L168 Benchmark]: RCFGBuilder took 781.62 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 107.0 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:28,296 INFO L168 Benchmark]: TraceAbstraction took 28894.10 ms. Allocated memory was 203.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 106.1 MB in the beginning and 1.0 GB in the end (delta: -902.9 MB). Peak memory consumption was 638.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:28,300 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.21 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.11 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 157.5 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.23 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.62 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 107.0 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28894.10 ms. Allocated memory was 203.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 106.1 MB in the beginning and 1.0 GB in the end (delta: -902.9 MB). Peak memory consumption was 638.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1040, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1800 SDtfs, 2563 SDslu, 2872 SDs, 0 SdLazy, 1049 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31012occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 15582 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 29991 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...