/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/mix037_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:23:18,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:23:18,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:23:18,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:23:18,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:23:18,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:23:18,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:23:18,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:23:18,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:23:18,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:23:18,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:23:18,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:23:18,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:23:18,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:23:18,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:23:18,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:23:18,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:23:18,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:23:18,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:23:18,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:23:18,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:23:18,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:23:18,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:23:18,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:23:18,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:23:18,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:23:18,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:23:18,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:23:18,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:23:18,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:23:18,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:23:18,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:23:18,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:23:18,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:23:18,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:23:18,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:23:18,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:23:18,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:23:18,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:23:18,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:23:18,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:23:18,563 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:23:18,595 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:23:18,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:23:18,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:23:18,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:23:18,598 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:23:18,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:23:18,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:23:18,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:23:18,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:23:18,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:23:18,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:23:18,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:23:18,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:23:18,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:23:18,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:23:18,600 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:23:18,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:23:18,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:23:18,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:23:18,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:23:18,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:23:18,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:23:18,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:23:18,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:23:18,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:23:18,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:23:18,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:23:18,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:23:18,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:23:18,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:23:18,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:23:18,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:23:18,895 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:23:18,895 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:23:18,896 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-27 02:23:18,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8038847e0/c7b7a442dadf4ffc94403aa72e1ad3d2/FLAGfcd512ee3 [2019-12-27 02:23:19,450 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:23:19,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-27 02:23:19,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8038847e0/c7b7a442dadf4ffc94403aa72e1ad3d2/FLAGfcd512ee3 [2019-12-27 02:23:19,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8038847e0/c7b7a442dadf4ffc94403aa72e1ad3d2 [2019-12-27 02:23:19,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:23:19,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:23:19,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:23:19,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:23:19,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:23:19,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:23:19" (1/1) ... [2019-12-27 02:23:19,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ddd57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:19, skipping insertion in model container [2019-12-27 02:23:19,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:23:19" (1/1) ... [2019-12-27 02:23:19,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:23:19,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:23:20,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:23:20,344 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:23:20,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:23:20,510 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:23:20,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:20 WrapperNode [2019-12-27 02:23:20,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:23:20,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:23:20,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:23:20,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:23:20,522 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:23:20" (1/1) ... [2019-12-27 02:23:20,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:23:20" (1/1) ... [2019-12-27 02:23:20,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:23:20,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:23:20,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:23:20,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:23:20,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:23:20" (1/1) ... [2019-12-27 02:23:20,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:20" (1/1) ... [2019-12-27 02:23:20,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:23:20" (1/1) ... [2019-12-27 02:23:20,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:23:20" (1/1) ... [2019-12-27 02:23:20,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:20" (1/1) ... [2019-12-27 02:23:20,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:20" (1/1) ... [2019-12-27 02:23:20,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:23:20" (1/1) ... [2019-12-27 02:23:20,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:23:20,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:23:20,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:23:20,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:23:20,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:20" (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:23:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:23:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:23:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:23:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:23:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:23:20,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:23:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:23:20,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:23:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:23:20,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:23:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:23:20,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:23:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:23:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:23:20,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:23:20,680 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:23:21,413 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:23:21,414 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:23:21,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:23:21 BoogieIcfgContainer [2019-12-27 02:23:21,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:23:21,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:23:21,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:23:21,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:23:21,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:23:19" (1/3) ... [2019-12-27 02:23:21,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fd02b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:23:21, skipping insertion in model container [2019-12-27 02:23:21,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:20" (2/3) ... [2019-12-27 02:23:21,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fd02b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:23:21, skipping insertion in model container [2019-12-27 02:23:21,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:23:21" (3/3) ... [2019-12-27 02:23:21,425 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i [2019-12-27 02:23:21,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:23:21,436 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:23:21,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:23:21,446 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:23:21,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,534 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,535 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,535 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,535 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,535 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,535 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,544 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,556 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,557 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,558 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:23:21,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:23:21,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:23:21,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:23:21,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:23:21,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:23:21,600 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:23:21,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:23:21,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:23:21,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:23:21,618 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 02:23:21,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:23:21,718 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:23:21,718 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:23:21,735 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:23:21,765 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 02:23:21,822 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 02:23:21,823 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:23:21,835 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:23:21,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:23:21,865 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:23:26,801 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:23:26,941 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:23:27,551 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:23:27,757 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:23:27,784 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 02:23:27,784 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 02:23:27,789 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 02:23:29,181 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 02:23:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 02:23:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:23:29,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:29,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:29,192 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:23:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 02:23:29,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:29,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558542459] [2019-12-27 02:23:29,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:29,440 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:23:29,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558542459] [2019-12-27 02:23:29,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:29,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:23:29,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261201155] [2019-12-27 02:23:29,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:29,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:29,476 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 02:23:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:30,578 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 02:23:30,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:30,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:23:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:30,778 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 02:23:30,778 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 02:23:30,780 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:23:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 02:23:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 02:23:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 02:23:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 02:23:31,861 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 02:23:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:31,862 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 02:23:31,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 02:23:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:23:31,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:31,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:31,869 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:23:31,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 02:23:31,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:31,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564471148] [2019-12-27 02:23:31,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:32,051 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:23:32,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564471148] [2019-12-27 02:23:32,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:32,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:23:32,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066388064] [2019-12-27 02:23:32,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:23:32,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:32,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:23:32,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:23:32,055 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 02:23:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:33,752 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 02:23:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:23:33,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:23:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:33,883 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 02:23:33,884 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 02:23:33,885 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:23:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 02:23:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 02:23:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 02:23:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 02:23:34,968 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 02:23:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:34,969 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 02:23:34,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 02:23:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:23:34,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:34,975 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:23:34,976 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:23:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 02:23:34,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:34,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136803686] [2019-12-27 02:23:34,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:35,115 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:23:35,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136803686] [2019-12-27 02:23:35,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:35,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:23:35,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247358569] [2019-12-27 02:23:35,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:23:35,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:35,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:23:35,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:23:35,118 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-27 02:23:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:35,818 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 02:23:35,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:23:35,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:23:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:35,950 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 02:23:35,951 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 02:23:35,951 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:23:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 02:23:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 02:23:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 02:23:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 02:23:37,223 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 02:23:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:37,223 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 02:23:37,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 02:23:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 02:23:37,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:37,234 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:23:37,234 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:23:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 02:23:37,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:37,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588635265] [2019-12-27 02:23:37,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:37,298 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:23:37,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588635265] [2019-12-27 02:23:37,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:37,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:23:37,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009826041] [2019-12-27 02:23:37,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:37,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:37,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:37,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:37,301 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 02:23:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:37,472 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-27 02:23:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:37,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 02:23:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:37,581 INFO L225 Difference]: With dead ends: 29747 [2019-12-27 02:23:37,581 INFO L226 Difference]: Without dead ends: 29747 [2019-12-27 02:23:37,582 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:23:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-27 02:23:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-27 02:23:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-27 02:23:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-27 02:23:39,930 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-27 02:23:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:39,931 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-27 02:23:39,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-27 02:23:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:23:39,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:39,942 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:23:39,942 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:23:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-27 02:23:39,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:39,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344649950] [2019-12-27 02:23:39,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:39,985 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:23:39,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344649950] [2019-12-27 02:23:39,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:39,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:23:39,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780296937] [2019-12-27 02:23:39,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:39,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:39,988 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-27 02:23:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:40,165 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-27 02:23:40,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:40,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:23:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:40,237 INFO L225 Difference]: With dead ends: 36709 [2019-12-27 02:23:40,238 INFO L226 Difference]: Without dead ends: 30167 [2019-12-27 02:23:40,238 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:23:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-27 02:23:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-27 02:23:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-27 02:23:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-27 02:23:41,206 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-27 02:23:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:41,206 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-27 02:23:41,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-27 02:23:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:23:41,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:41,220 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:23:41,220 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:23:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:41,221 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 02:23:41,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:41,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807031144] [2019-12-27 02:23:41,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:41,308 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:23:41,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807031144] [2019-12-27 02:23:41,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:41,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:23:41,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638484982] [2019-12-27 02:23:41,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:41,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:41,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:41,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:41,311 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-27 02:23:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:41,448 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-27 02:23:41,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:41,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:23:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:41,516 INFO L225 Difference]: With dead ends: 29289 [2019-12-27 02:23:41,516 INFO L226 Difference]: Without dead ends: 29289 [2019-12-27 02:23:41,517 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:23:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-27 02:23:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-27 02:23:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-27 02:23:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-27 02:23:42,658 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-27 02:23:42,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:42,658 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-27 02:23:42,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-27 02:23:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:23:42,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:42,671 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:23:42,671 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:23:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-27 02:23:42,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:42,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444707353] [2019-12-27 02:23:42,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:42,750 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:23:42,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444707353] [2019-12-27 02:23:42,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:42,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:23:42,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983722885] [2019-12-27 02:23:42,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:23:42,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:23:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:23:42,753 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 5 states. [2019-12-27 02:23:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:42,883 INFO L93 Difference]: Finished difference Result 12827 states and 41537 transitions. [2019-12-27 02:23:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:23:42,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:23:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:42,900 INFO L225 Difference]: With dead ends: 12827 [2019-12-27 02:23:42,900 INFO L226 Difference]: Without dead ends: 10855 [2019-12-27 02:23:42,901 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:23:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2019-12-27 02:23:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 10855. [2019-12-27 02:23:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10855 states. [2019-12-27 02:23:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 34345 transitions. [2019-12-27 02:23:43,079 INFO L78 Accepts]: Start accepts. Automaton has 10855 states and 34345 transitions. Word has length 22 [2019-12-27 02:23:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:43,080 INFO L462 AbstractCegarLoop]: Abstraction has 10855 states and 34345 transitions. [2019-12-27 02:23:43,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:23:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 10855 states and 34345 transitions. [2019-12-27 02:23:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:23:43,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:43,084 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:23:43,084 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:23:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-27 02:23:43,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:43,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715120559] [2019-12-27 02:23:43,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:43,134 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:23:43,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715120559] [2019-12-27 02:23:43,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:43,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:23:43,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953280587] [2019-12-27 02:23:43,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:23:43,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:23:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:23:43,137 INFO L87 Difference]: Start difference. First operand 10855 states and 34345 transitions. Second operand 4 states. [2019-12-27 02:23:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:43,224 INFO L93 Difference]: Finished difference Result 16412 states and 52778 transitions. [2019-12-27 02:23:43,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:23:43,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 02:23:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:43,239 INFO L225 Difference]: With dead ends: 16412 [2019-12-27 02:23:43,240 INFO L226 Difference]: Without dead ends: 8743 [2019-12-27 02:23:43,240 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:23:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2019-12-27 02:23:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8444. [2019-12-27 02:23:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-27 02:23:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 26914 transitions. [2019-12-27 02:23:43,366 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 26914 transitions. Word has length 23 [2019-12-27 02:23:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:43,367 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 26914 transitions. [2019-12-27 02:23:43,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 26914 transitions. [2019-12-27 02:23:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:23:43,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:43,370 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:23:43,370 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:23:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1799428640, now seen corresponding path program 2 times [2019-12-27 02:23:43,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:43,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380410625] [2019-12-27 02:23:43,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:43,439 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:23:43,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380410625] [2019-12-27 02:23:43,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:43,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:23:43,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905253159] [2019-12-27 02:23:43,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:43,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:43,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:43,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:43,443 INFO L87 Difference]: Start difference. First operand 8444 states and 26914 transitions. Second operand 3 states. [2019-12-27 02:23:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:43,494 INFO L93 Difference]: Finished difference Result 8444 states and 26506 transitions. [2019-12-27 02:23:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:43,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-27 02:23:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:43,512 INFO L225 Difference]: With dead ends: 8444 [2019-12-27 02:23:43,513 INFO L226 Difference]: Without dead ends: 8444 [2019-12-27 02:23:43,513 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:23:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8444 states. [2019-12-27 02:23:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8444 to 8146. [2019-12-27 02:23:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8146 states. [2019-12-27 02:23:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 25593 transitions. [2019-12-27 02:23:44,519 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 25593 transitions. Word has length 23 [2019-12-27 02:23:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:44,519 INFO L462 AbstractCegarLoop]: Abstraction has 8146 states and 25593 transitions. [2019-12-27 02:23:44,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 25593 transitions. [2019-12-27 02:23:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:23:44,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:44,523 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:23:44,523 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:23:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash -417737333, now seen corresponding path program 1 times [2019-12-27 02:23:44,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:44,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979551820] [2019-12-27 02:23:44,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:44,602 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:23:44,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979551820] [2019-12-27 02:23:44,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:44,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:23:44,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508021071] [2019-12-27 02:23:44,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:44,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:44,604 INFO L87 Difference]: Start difference. First operand 8146 states and 25593 transitions. Second operand 6 states. [2019-12-27 02:23:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:44,696 INFO L93 Difference]: Finished difference Result 3111 states and 8924 transitions. [2019-12-27 02:23:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:23:44,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 02:23:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:44,702 INFO L225 Difference]: With dead ends: 3111 [2019-12-27 02:23:44,702 INFO L226 Difference]: Without dead ends: 2590 [2019-12-27 02:23:44,702 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:23:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2019-12-27 02:23:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2019-12-27 02:23:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-12-27 02:23:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 7335 transitions. [2019-12-27 02:23:44,743 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 7335 transitions. Word has length 24 [2019-12-27 02:23:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:44,744 INFO L462 AbstractCegarLoop]: Abstraction has 2590 states and 7335 transitions. [2019-12-27 02:23:44,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 7335 transitions. [2019-12-27 02:23:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:23:44,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:44,747 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:23:44,747 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:23:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 02:23:44,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:44,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921163818] [2019-12-27 02:23:44,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:44,779 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:23:44,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921163818] [2019-12-27 02:23:44,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:44,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:23:44,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357866062] [2019-12-27 02:23:44,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:23:44,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:23:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:23:44,781 INFO L87 Difference]: Start difference. First operand 2590 states and 7335 transitions. Second operand 3 states. [2019-12-27 02:23:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:44,833 INFO L93 Difference]: Finished difference Result 3908 states and 10998 transitions. [2019-12-27 02:23:44,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:23:44,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 02:23:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:44,841 INFO L225 Difference]: With dead ends: 3908 [2019-12-27 02:23:44,841 INFO L226 Difference]: Without dead ends: 3908 [2019-12-27 02:23:44,842 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:23:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-12-27 02:23:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3066. [2019-12-27 02:23:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2019-12-27 02:23:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 8797 transitions. [2019-12-27 02:23:44,886 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 8797 transitions. Word has length 32 [2019-12-27 02:23:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:44,886 INFO L462 AbstractCegarLoop]: Abstraction has 3066 states and 8797 transitions. [2019-12-27 02:23:44,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:23:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 8797 transitions. [2019-12-27 02:23:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:23:44,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:44,891 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:23:44,891 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:23:44,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:44,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 02:23:44,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:44,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23893965] [2019-12-27 02:23:44,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:44,976 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:23:44,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23893965] [2019-12-27 02:23:44,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:44,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:23:44,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936560374] [2019-12-27 02:23:44,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:44,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:44,978 INFO L87 Difference]: Start difference. First operand 3066 states and 8797 transitions. Second operand 6 states. [2019-12-27 02:23:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:45,481 INFO L93 Difference]: Finished difference Result 6462 states and 17612 transitions. [2019-12-27 02:23:45,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:23:45,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 02:23:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:45,491 INFO L225 Difference]: With dead ends: 6462 [2019-12-27 02:23:45,491 INFO L226 Difference]: Without dead ends: 6324 [2019-12-27 02:23:45,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2019-12-27 02:23:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 3196. [2019-12-27 02:23:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2019-12-27 02:23:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 9125 transitions. [2019-12-27 02:23:45,547 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 9125 transitions. Word has length 32 [2019-12-27 02:23:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:45,548 INFO L462 AbstractCegarLoop]: Abstraction has 3196 states and 9125 transitions. [2019-12-27 02:23:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 9125 transitions. [2019-12-27 02:23:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:23:45,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:45,552 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:23:45,552 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:23:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:45,553 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 02:23:45,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:45,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236386972] [2019-12-27 02:23:45,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:45,645 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:23:45,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236386972] [2019-12-27 02:23:45,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:45,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:23:45,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655846519] [2019-12-27 02:23:45,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:45,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:45,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:45,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:45,648 INFO L87 Difference]: Start difference. First operand 3196 states and 9125 transitions. Second operand 6 states. [2019-12-27 02:23:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:46,142 INFO L93 Difference]: Finished difference Result 6123 states and 16579 transitions. [2019-12-27 02:23:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:23:46,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:23:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:46,152 INFO L225 Difference]: With dead ends: 6123 [2019-12-27 02:23:46,152 INFO L226 Difference]: Without dead ends: 5979 [2019-12-27 02:23:46,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-27 02:23:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3000. [2019-12-27 02:23:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2019-12-27 02:23:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 8617 transitions. [2019-12-27 02:23:46,204 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 8617 transitions. Word has length 33 [2019-12-27 02:23:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:46,204 INFO L462 AbstractCegarLoop]: Abstraction has 3000 states and 8617 transitions. [2019-12-27 02:23:46,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 8617 transitions. [2019-12-27 02:23:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:23:46,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:46,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:46,208 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:23:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:46,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-27 02:23:46,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:46,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706246194] [2019-12-27 02:23:46,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:46,299 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:23:46,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706246194] [2019-12-27 02:23:46,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:46,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:23:46,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282193030] [2019-12-27 02:23:46,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:23:46,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:46,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:23:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:23:46,301 INFO L87 Difference]: Start difference. First operand 3000 states and 8617 transitions. Second operand 7 states. [2019-12-27 02:23:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:46,429 INFO L93 Difference]: Finished difference Result 2263 states and 6813 transitions. [2019-12-27 02:23:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:23:46,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:23:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:46,434 INFO L225 Difference]: With dead ends: 2263 [2019-12-27 02:23:46,434 INFO L226 Difference]: Without dead ends: 1607 [2019-12-27 02:23:46,435 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:23:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-12-27 02:23:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1553. [2019-12-27 02:23:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-12-27 02:23:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 4536 transitions. [2019-12-27 02:23:46,463 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 4536 transitions. Word has length 33 [2019-12-27 02:23:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:46,464 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 4536 transitions. [2019-12-27 02:23:46,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:23:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 4536 transitions. [2019-12-27 02:23:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:46,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:46,468 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:23:46,468 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:23:46,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash -978641481, now seen corresponding path program 1 times [2019-12-27 02:23:46,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:46,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834074415] [2019-12-27 02:23:46,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:46,578 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:23:46,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834074415] [2019-12-27 02:23:46,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:46,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:23:46,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305695454] [2019-12-27 02:23:46,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:23:46,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:23:46,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:23:46,580 INFO L87 Difference]: Start difference. First operand 1553 states and 4536 transitions. Second operand 6 states. [2019-12-27 02:23:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:46,824 INFO L93 Difference]: Finished difference Result 4702 states and 13602 transitions. [2019-12-27 02:23:46,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:23:46,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-27 02:23:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:46,831 INFO L225 Difference]: With dead ends: 4702 [2019-12-27 02:23:46,831 INFO L226 Difference]: Without dead ends: 3062 [2019-12-27 02:23:46,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:23:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-12-27 02:23:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 1755. [2019-12-27 02:23:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-27 02:23:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 5105 transitions. [2019-12-27 02:23:46,860 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 5105 transitions. Word has length 48 [2019-12-27 02:23:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:46,861 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 5105 transitions. [2019-12-27 02:23:46,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:23:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 5105 transitions. [2019-12-27 02:23:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:46,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:46,864 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:23:46,864 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:23:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 2 times [2019-12-27 02:23:46,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:46,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824578709] [2019-12-27 02:23:46,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:46,929 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:23:46,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824578709] [2019-12-27 02:23:46,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:46,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:23:46,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099350055] [2019-12-27 02:23:46,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:23:46,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:46,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:23:46,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:23:46,931 INFO L87 Difference]: Start difference. First operand 1755 states and 5105 transitions. Second operand 4 states. [2019-12-27 02:23:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:46,953 INFO L93 Difference]: Finished difference Result 2211 states and 6131 transitions. [2019-12-27 02:23:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:23:46,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-27 02:23:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:46,954 INFO L225 Difference]: With dead ends: 2211 [2019-12-27 02:23:46,955 INFO L226 Difference]: Without dead ends: 504 [2019-12-27 02:23:46,955 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:23:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-27 02:23:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-12-27 02:23:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-27 02:23:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1111 transitions. [2019-12-27 02:23:46,962 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1111 transitions. Word has length 48 [2019-12-27 02:23:46,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:46,962 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 1111 transitions. [2019-12-27 02:23:46,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:23:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1111 transitions. [2019-12-27 02:23:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:46,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:46,963 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:23:46,964 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:23:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 3 times [2019-12-27 02:23:46,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:46,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47916846] [2019-12-27 02:23:46,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:23:47,036 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:23:47,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47916846] [2019-12-27 02:23:47,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:23:47,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:23:47,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655239693] [2019-12-27 02:23:47,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:23:47,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:23:47,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:23:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:23:47,038 INFO L87 Difference]: Start difference. First operand 504 states and 1111 transitions. Second operand 7 states. [2019-12-27 02:23:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:23:47,194 INFO L93 Difference]: Finished difference Result 892 states and 1938 transitions. [2019-12-27 02:23:47,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:23:47,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:23:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:23:47,196 INFO L225 Difference]: With dead ends: 892 [2019-12-27 02:23:47,196 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 02:23:47,196 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:23:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 02:23:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-27 02:23:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 02:23:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-27 02:23:47,206 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-27 02:23:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:23:47,207 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-27 02:23:47,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:23:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-27 02:23:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:23:47,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:23:47,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:23:47,208 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:23:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:23:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 4 times [2019-12-27 02:23:47,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:23:47,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788202920] [2019-12-27 02:23:47,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:23:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:23:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:23:47,341 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:23:47,341 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:23:47,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59|) |v_ULTIMATE.start_main_~#t989~0.offset_37| 0))) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t989~0.base_59| 4)) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59|)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t989~0.base_59|) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t989~0.offset_37|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59| 1) |v_#valid_105|) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_23|, 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, #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_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, 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_37, ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_56|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #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_71, ULTIMATE.start_main_~#t989~0.base=|v_ULTIMATE.start_main_~#t989~0.base_59|, ~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|, ~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_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_32|, ~y~0=v_~y~0_19, ~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, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_32|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t989~0.offset=|v_ULTIMATE.start_main_~#t989~0.offset_37|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t990~0.base, ~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_~#t989~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t990~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t991~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t992~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t989~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-27 02:23:47,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t990~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t990~0.offset_10| 0) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t990~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11|) |v_ULTIMATE.start_main_~#t990~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t990~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t990~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t990~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:23:47,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t991~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t991~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12|) |v_ULTIMATE.start_main_~#t991~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t991~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t991~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t991~0.base, #length] because there is no mapped edge [2019-12-27 02:23:47,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12|) |v_ULTIMATE.start_main_~#t992~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t992~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t992~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t992~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t992~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_12|, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t992~0.base, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-27 02:23:47,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~__unbuffered_p3_EBX~0_Out1046630546 ~b~0_In1046630546) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1046630546)) (= 1 ~z$r_buff0_thd4~0_Out1046630546) (= ~a~0_Out1046630546 ~__unbuffered_p3_EAX~0_Out1046630546) (= ~a~0_Out1046630546 1) (= ~z$r_buff0_thd0~0_In1046630546 ~z$r_buff1_thd0~0_Out1046630546) (= ~z$r_buff1_thd3~0_Out1046630546 ~z$r_buff0_thd3~0_In1046630546) (= ~z$r_buff0_thd1~0_In1046630546 ~z$r_buff1_thd1~0_Out1046630546) (= ~z$r_buff1_thd2~0_Out1046630546 ~z$r_buff0_thd2~0_In1046630546) (= ~z$r_buff1_thd4~0_Out1046630546 ~z$r_buff0_thd4~0_In1046630546)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1046630546, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1046630546, ~b~0=~b~0_In1046630546, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1046630546, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1046630546, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1046630546, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1046630546} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1046630546, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1046630546, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1046630546, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1046630546, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1046630546, ~a~0=~a~0_Out1046630546, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1046630546, ~b~0=~b~0_In1046630546, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1046630546, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1046630546, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1046630546, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1046630546, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1046630546, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1046630546, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1046630546} 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:23:47,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= 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|} OutVars{~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_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 02:23:47,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) 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, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, 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_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 02:23:47,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-821694011 256) 0))) (or (and (= ~z$w_buff0~0_In-821694011 |P2Thread1of1ForFork1_#t~ite8_Out-821694011|) .cse0 (= |P2Thread1of1ForFork1_#t~ite9_Out-821694011| |P2Thread1of1ForFork1_#t~ite8_Out-821694011|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-821694011 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-821694011 256))) (= 0 (mod ~z$w_buff0_used~0_In-821694011 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-821694011 256) 0))))) (and (= ~z$w_buff0~0_In-821694011 |P2Thread1of1ForFork1_#t~ite9_Out-821694011|) (= |P2Thread1of1ForFork1_#t~ite8_In-821694011| |P2Thread1of1ForFork1_#t~ite8_Out-821694011|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-821694011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-821694011, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-821694011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-821694011, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-821694011, ~weak$$choice2~0=~weak$$choice2~0_In-821694011, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-821694011|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-821694011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-821694011, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-821694011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-821694011, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-821694011, ~weak$$choice2~0=~weak$$choice2~0_In-821694011, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-821694011|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-821694011|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:23:47,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-694210176 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out-694210176| |P2Thread1of1ForFork1_#t~ite11_Out-694210176|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-694210176 256)))) (or (= (mod ~z$w_buff0_used~0_In-694210176 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-694210176 256))) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-694210176 256) 0)))) (= ~z$w_buff1~0_In-694210176 |P2Thread1of1ForFork1_#t~ite11_Out-694210176|) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite12_Out-694210176| ~z$w_buff1~0_In-694210176) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_In-694210176| |P2Thread1of1ForFork1_#t~ite11_Out-694210176|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-694210176, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-694210176, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-694210176|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-694210176, ~z$w_buff1~0=~z$w_buff1~0_In-694210176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-694210176, ~weak$$choice2~0=~weak$$choice2~0_In-694210176} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-694210176, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-694210176|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-694210176, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-694210176|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-694210176, ~z$w_buff1~0=~z$w_buff1~0_In-694210176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-694210176, ~weak$$choice2~0=~weak$$choice2~0_In-694210176} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:23:47,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1739302577 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out1739302577| ~z$w_buff0_used~0_In1739302577) .cse0 (= |P2Thread1of1ForFork1_#t~ite15_Out1739302577| |P2Thread1of1ForFork1_#t~ite14_Out1739302577|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1739302577 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1739302577 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1739302577 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1739302577 256) 0))))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1739302577| |P2Thread1of1ForFork1_#t~ite14_Out1739302577|) (= |P2Thread1of1ForFork1_#t~ite15_Out1739302577| ~z$w_buff0_used~0_In1739302577)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1739302577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1739302577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1739302577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1739302577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1739302577, ~weak$$choice2~0=~weak$$choice2~0_In1739302577} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1739302577|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1739302577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1739302577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1739302577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1739302577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1739302577, ~weak$$choice2~0=~weak$$choice2~0_In1739302577} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 02:23:47,360 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:23:47,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-687252382 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-687252382 |P2Thread1of1ForFork1_#t~ite23_Out-687252382|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-687252382 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-687252382 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-687252382 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-687252382 256)))) (= |P2Thread1of1ForFork1_#t~ite23_Out-687252382| |P2Thread1of1ForFork1_#t~ite24_Out-687252382|)) (and (= ~z$r_buff1_thd3~0_In-687252382 |P2Thread1of1ForFork1_#t~ite24_Out-687252382|) (= |P2Thread1of1ForFork1_#t~ite23_In-687252382| |P2Thread1of1ForFork1_#t~ite23_Out-687252382|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-687252382, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-687252382, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-687252382|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-687252382, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-687252382, ~weak$$choice2~0=~weak$$choice2~0_In-687252382} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-687252382|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-687252382, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-687252382, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-687252382|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-687252382, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-687252382, ~weak$$choice2~0=~weak$$choice2~0_In-687252382} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 02:23:47,362 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:23:47,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1019197473 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1019197473 256) 0))) (or (and (= ~z$w_buff0_used~0_In1019197473 |P3Thread1of1ForFork2_#t~ite28_Out1019197473|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out1019197473| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1019197473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1019197473} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1019197473|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1019197473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1019197473} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:23:47,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In69046289 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In69046289 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In69046289 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In69046289 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out69046289|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In69046289 |P3Thread1of1ForFork2_#t~ite29_Out69046289|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In69046289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In69046289, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In69046289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69046289} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out69046289|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In69046289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In69046289, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In69046289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69046289} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:23:47,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1076697532 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1076697532 256)))) (or (and (= ~z$r_buff0_thd4~0_Out1076697532 ~z$r_buff0_thd4~0_In1076697532) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1076697532) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1076697532, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1076697532} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1076697532, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1076697532, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1076697532|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 02:23:47,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In1348614351 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1348614351 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1348614351 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1348614351 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out1348614351| ~z$r_buff1_thd4~0_In1348614351)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out1348614351| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1348614351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1348614351, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1348614351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1348614351} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1348614351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1348614351, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1348614351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1348614351, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1348614351|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:23:47,365 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:23:47,366 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:23:47,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite37_Out-1074155318| |ULTIMATE.start_main_#t~ite36_Out-1074155318|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1074155318 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1074155318 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In-1074155318 |ULTIMATE.start_main_#t~ite36_Out-1074155318|) (not .cse1) (not .cse2)) (and .cse0 (= ~z~0_In-1074155318 |ULTIMATE.start_main_#t~ite36_Out-1074155318|) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1074155318, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1074155318, ~z$w_buff1~0=~z$w_buff1~0_In-1074155318, ~z~0=~z~0_In-1074155318} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1074155318, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1074155318, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1074155318|, ~z$w_buff1~0=~z$w_buff1~0_In-1074155318, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1074155318|, ~z~0=~z~0_In-1074155318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:23:47,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1629186584 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1629186584 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1629186584| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1629186584 |ULTIMATE.start_main_#t~ite38_Out-1629186584|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1629186584, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1629186584} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1629186584, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1629186584, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1629186584|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:23:47,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1724961801 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1724961801 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1724961801 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1724961801 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1724961801 |ULTIMATE.start_main_#t~ite39_Out-1724961801|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1724961801|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1724961801, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1724961801, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1724961801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1724961801} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1724961801, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1724961801|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1724961801, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1724961801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1724961801} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:23:47,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1676408577 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1676408577 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1676408577| ~z$r_buff0_thd0~0_In1676408577)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out1676408577|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1676408577, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1676408577} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1676408577, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1676408577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1676408577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:23:47,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-896537811 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-896537811 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-896537811 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-896537811 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-896537811 |ULTIMATE.start_main_#t~ite41_Out-896537811|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out-896537811| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-896537811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-896537811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-896537811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-896537811} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-896537811|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-896537811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-896537811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-896537811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-896537811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:23:47,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~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_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, 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:23:47,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:23:47 BasicIcfg [2019-12-27 02:23:47,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:23:47,485 INFO L168 Benchmark]: Toolchain (without parser) took 27746.85 ms. Allocated memory was 140.0 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 102.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 281.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:47,488 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 02:23:47,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.27 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 158.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:47,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:47,491 INFO L168 Benchmark]: Boogie Preprocessor took 37.97 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:47,492 INFO L168 Benchmark]: RCFGBuilder took 803.37 ms. Allocated memory is still 204.5 MB. Free memory was 153.3 MB in the beginning and 106.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:47,493 INFO L168 Benchmark]: TraceAbstraction took 26064.53 ms. Allocated memory was 204.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 106.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 221.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:23:47,499 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.41 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.27 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 158.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.97 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 803.37 ms. Allocated memory is still 204.5 MB. Free memory was 153.3 MB in the beginning and 106.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26064.53 ms. Allocated memory was 204.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 106.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 221.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 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(&t989, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t990, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t991, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t992, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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=1, 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 = 1 [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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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: 25.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1952 SDtfs, 2485 SDslu, 3382 SDs, 0 SdLazy, 1174 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 17217 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 38473 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...