/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/mix034_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:13:18,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:13:18,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:13:18,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:13:18,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:13:18,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:13:18,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:13:18,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:13:18,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:13:18,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:13:18,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:13:18,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:13:18,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:13:18,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:13:18,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:13:18,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:13:18,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:13:18,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:13:18,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:13:18,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:13:18,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:13:18,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:13:18,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:13:18,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:13:18,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:13:18,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:13:18,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:13:18,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:13:18,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:13:18,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:13:18,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:13:18,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:13:18,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:13:18,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:13:18,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:13:18,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:13:18,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:13:18,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:13:18,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:13:18,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:13:18,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:13:18,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:13:18,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:13:18,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:13:18,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:13:18,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:13:18,557 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:13:18,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:13:18,558 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:13:18,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:13:18,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:13:18,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:13:18,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:13:18,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:13:18,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:13:18,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:13:18,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:13:18,560 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:13:18,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:13:18,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:13:18,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:13:18,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:13:18,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:13:18,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:18,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:13:18,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:13:18,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:13:18,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:13:18,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:13:18,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:13:18,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:13:18,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:13:18,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:13:18,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:13:18,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:13:18,901 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:13:18,901 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i [2019-12-18 17:13:18,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ae8557c/871d8dba0f3b493db619ae67c6dc35fd/FLAG787648ea3 [2019-12-18 17:13:19,522 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:13:19,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_rmo.opt.i [2019-12-18 17:13:19,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ae8557c/871d8dba0f3b493db619ae67c6dc35fd/FLAG787648ea3 [2019-12-18 17:13:19,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ae8557c/871d8dba0f3b493db619ae67c6dc35fd [2019-12-18 17:13:19,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:13:19,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:13:19,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:19,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:13:19,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:13:19,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:19" (1/1) ... [2019-12-18 17:13:19,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163f1a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:19, skipping insertion in model container [2019-12-18 17:13:19,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:19" (1/1) ... [2019-12-18 17:13:19,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:13:19,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:13:20,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:20,439 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:13:20,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:20,588 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:13:20,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20 WrapperNode [2019-12-18 17:13:20,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:20,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:20,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:13:20,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:13:20,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:20,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:13:20,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:13:20,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:13:20,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (1/1) ... [2019-12-18 17:13:20,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:13:20,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:13:20,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:13:20,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:13:20,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13: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-18 17:13:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:13:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:13:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:13:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:13:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:13:20,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:13:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:13:20,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:13:20,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:13:20,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:13:20,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:13:20,782 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:13:21,475 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:13:21,475 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:13:21,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:21 BoogieIcfgContainer [2019-12-18 17:13:21,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:13:21,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:13:21,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:13:21,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:13:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:13:19" (1/3) ... [2019-12-18 17:13:21,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df9d499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:21, skipping insertion in model container [2019-12-18 17:13:21,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:20" (2/3) ... [2019-12-18 17:13:21,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df9d499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:21, skipping insertion in model container [2019-12-18 17:13:21,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:21" (3/3) ... [2019-12-18 17:13:21,486 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.opt.i [2019-12-18 17:13:21,497 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:13:21,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:13:21,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:13:21,507 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:13:21,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,599 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,622 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,624 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:21,642 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 17:13:21,665 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:13:21,665 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:13:21,665 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:13:21,665 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:13:21,665 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:13:21,666 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:13:21,666 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:13:21,666 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:13:21,683 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-18 17:13:21,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 17:13:21,763 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 17:13:21,763 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:21,778 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:13:21,798 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 17:13:21,837 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 17:13:21,838 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:21,843 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:13:21,859 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 17:13:21,860 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:13:26,804 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 17:13:26,935 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:13:27,178 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-18 17:13:27,179 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 17:13:27,183 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-18 17:13:27,674 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-18 17:13:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-18 17:13:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:13:27,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:27,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:13:27,683 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:27,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-18 17:13:27,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:27,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896580721] [2019-12-18 17:13:27,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:27,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-18 17:13:27,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896580721] [2019-12-18 17:13:27,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:27,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:13:27,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860138279] [2019-12-18 17:13:27,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:27,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:27,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:27,961 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-18 17:13:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:28,336 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-18 17:13:28,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:28,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:13:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:28,477 INFO L225 Difference]: With dead ends: 8598 [2019-12-18 17:13:28,477 INFO L226 Difference]: Without dead ends: 7662 [2019-12-18 17:13:28,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-18 17:13:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-18 17:13:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-18 17:13:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-18 17:13:28,934 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-18 17:13:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:28,935 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-18 17:13:28,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-18 17:13:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:13:28,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:28,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:28,939 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-18 17:13:28,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:28,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113759084] [2019-12-18 17:13:28,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:29,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113759084] [2019-12-18 17:13:29,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:29,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:29,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193022650] [2019-12-18 17:13:29,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:29,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:29,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:29,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:29,017 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-18 17:13:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:29,043 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-18 17:13:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:29,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 17:13:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:29,051 INFO L225 Difference]: With dead ends: 1232 [2019-12-18 17:13:29,051 INFO L226 Difference]: Without dead ends: 1232 [2019-12-18 17:13:29,052 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-18 17:13:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-18 17:13:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-18 17:13:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-18 17:13:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-18 17:13:29,083 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-18 17:13:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:29,083 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-18 17:13:29,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-18 17:13:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:29,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:29,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:29,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:29,087 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-18 17:13:29,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:29,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492793264] [2019-12-18 17:13:29,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:29,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492793264] [2019-12-18 17:13:29,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:29,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:29,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723811214] [2019-12-18 17:13:29,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:29,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:29,211 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-18 17:13:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:29,294 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-18 17:13:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:29,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 17:13:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:29,306 INFO L225 Difference]: With dead ends: 1943 [2019-12-18 17:13:29,306 INFO L226 Difference]: Without dead ends: 1943 [2019-12-18 17:13:29,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-18 17:13:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-18 17:13:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-18 17:13:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-18 17:13:29,355 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-18 17:13:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:29,356 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-18 17:13:29,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-18 17:13:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:29,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:29,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:29,362 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-18 17:13:29,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:29,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225351054] [2019-12-18 17:13:29,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:29,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225351054] [2019-12-18 17:13:29,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:29,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:29,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017001867] [2019-12-18 17:13:29,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:29,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:29,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:29,528 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-18 17:13:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:29,725 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-18 17:13:29,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:13:29,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:13:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:29,734 INFO L225 Difference]: With dead ends: 1724 [2019-12-18 17:13:29,735 INFO L226 Difference]: Without dead ends: 1724 [2019-12-18 17:13:29,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-18 17:13:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-18 17:13:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-18 17:13:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-18 17:13:29,786 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-18 17:13:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:29,787 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-18 17:13:29,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-18 17:13:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:13:29,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:29,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:29,788 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:29,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-18 17:13:29,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:29,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526282397] [2019-12-18 17:13:29,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:29,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526282397] [2019-12-18 17:13:29,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:29,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:29,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125935117] [2019-12-18 17:13:29,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:29,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:29,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:29,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:29,854 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-18 17:13:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:30,067 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-18 17:13:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:13:30,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:13:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:30,079 INFO L225 Difference]: With dead ends: 1991 [2019-12-18 17:13:30,079 INFO L226 Difference]: Without dead ends: 1991 [2019-12-18 17:13:30,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-18 17:13:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-18 17:13:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-18 17:13:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-18 17:13:30,123 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-18 17:13:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:30,124 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-18 17:13:30,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-18 17:13:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:13:30,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:30,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:30,127 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:30,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:30,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-18 17:13:30,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:30,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747991203] [2019-12-18 17:13:30,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:30,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747991203] [2019-12-18 17:13:30,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:30,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:30,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014532088] [2019-12-18 17:13:30,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:13:30,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:13:30,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:30,241 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-18 17:13:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:30,491 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-18 17:13:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:13:30,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 17:13:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:30,503 INFO L225 Difference]: With dead ends: 2258 [2019-12-18 17:13:30,503 INFO L226 Difference]: Without dead ends: 2258 [2019-12-18 17:13:30,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-18 17:13:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-18 17:13:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-18 17:13:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-18 17:13:30,551 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-18 17:13:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:30,552 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-18 17:13:30,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:13:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-18 17:13:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:13:30,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:30,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:30,555 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:30,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-18 17:13:30,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:30,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005049433] [2019-12-18 17:13:30,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:30,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005049433] [2019-12-18 17:13:30,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:30,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:13:30,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507795929] [2019-12-18 17:13:30,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:30,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:30,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:30,602 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-18 17:13:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:30,615 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-18 17:13:30,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:30,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 17:13:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:30,625 INFO L225 Difference]: With dead ends: 2001 [2019-12-18 17:13:30,625 INFO L226 Difference]: Without dead ends: 2001 [2019-12-18 17:13:30,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-18 17:13:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-18 17:13:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-18 17:13:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-18 17:13:30,671 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-18 17:13:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:30,672 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-18 17:13:30,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-18 17:13:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:13:30,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:30,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:30,675 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-18 17:13:30,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:30,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962660741] [2019-12-18 17:13:30,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:30,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962660741] [2019-12-18 17:13:30,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:30,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:30,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172630343] [2019-12-18 17:13:30,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:13:30,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:13:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:30,811 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-18 17:13:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:31,159 INFO L93 Difference]: Finished difference Result 2378 states and 5234 transitions. [2019-12-18 17:13:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:13:31,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:13:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:31,166 INFO L225 Difference]: With dead ends: 2378 [2019-12-18 17:13:31,166 INFO L226 Difference]: Without dead ends: 2378 [2019-12-18 17:13:31,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-12-18 17:13:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1851. [2019-12-18 17:13:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-12-18 17:13:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 4184 transitions. [2019-12-18 17:13:31,215 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 4184 transitions. Word has length 26 [2019-12-18 17:13:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:31,215 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 4184 transitions. [2019-12-18 17:13:31,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:13:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 4184 transitions. [2019-12-18 17:13:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:13:31,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:31,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:31,218 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-18 17:13:31,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:31,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590426208] [2019-12-18 17:13:31,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:31,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590426208] [2019-12-18 17:13:31,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:31,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:13:31,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420147370] [2019-12-18 17:13:31,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:13:31,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:13:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:13:31,305 INFO L87 Difference]: Start difference. First operand 1851 states and 4184 transitions. Second operand 5 states. [2019-12-18 17:13:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:31,765 INFO L93 Difference]: Finished difference Result 2697 states and 5966 transitions. [2019-12-18 17:13:31,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:13:31,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 17:13:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:31,781 INFO L225 Difference]: With dead ends: 2697 [2019-12-18 17:13:31,782 INFO L226 Difference]: Without dead ends: 2697 [2019-12-18 17:13:31,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:13:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-12-18 17:13:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2381. [2019-12-18 17:13:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-12-18 17:13:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 5342 transitions. [2019-12-18 17:13:31,838 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 5342 transitions. Word has length 27 [2019-12-18 17:13:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:31,838 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 5342 transitions. [2019-12-18 17:13:31,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:13:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 5342 transitions. [2019-12-18 17:13:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:13:31,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:31,846 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] [2019-12-18 17:13:31,846 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-18 17:13:31,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:31,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23043637] [2019-12-18 17:13:31,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:31,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23043637] [2019-12-18 17:13:31,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:31,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:13:31,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353224877] [2019-12-18 17:13:31,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:13:31,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:13:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:31,935 INFO L87 Difference]: Start difference. First operand 2381 states and 5342 transitions. Second operand 4 states. [2019-12-18 17:13:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:31,951 INFO L93 Difference]: Finished difference Result 1330 states and 2854 transitions. [2019-12-18 17:13:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:13:31,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 17:13:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:31,955 INFO L225 Difference]: With dead ends: 1330 [2019-12-18 17:13:31,956 INFO L226 Difference]: Without dead ends: 1330 [2019-12-18 17:13:31,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:13:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-12-18 17:13:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1235. [2019-12-18 17:13:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-18 17:13:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2679 transitions. [2019-12-18 17:13:31,983 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2679 transitions. Word has length 28 [2019-12-18 17:13:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:31,984 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2679 transitions. [2019-12-18 17:13:31,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:13:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2679 transitions. [2019-12-18 17:13:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 17:13:31,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:31,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:31,989 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:31,989 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-18 17:13:31,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:31,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882532739] [2019-12-18 17:13:31,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:32,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882532739] [2019-12-18 17:13:32,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:32,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:13:32,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512810422] [2019-12-18 17:13:32,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:13:32,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:32,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:13:32,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:13:32,102 INFO L87 Difference]: Start difference. First operand 1235 states and 2679 transitions. Second operand 7 states. [2019-12-18 17:13:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:32,427 INFO L93 Difference]: Finished difference Result 3273 states and 6927 transitions. [2019-12-18 17:13:32,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:13:32,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 17:13:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:32,434 INFO L225 Difference]: With dead ends: 3273 [2019-12-18 17:13:32,434 INFO L226 Difference]: Without dead ends: 2143 [2019-12-18 17:13:32,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:13:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-12-18 17:13:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1275. [2019-12-18 17:13:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-18 17:13:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2768 transitions. [2019-12-18 17:13:32,467 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2768 transitions. Word has length 50 [2019-12-18 17:13:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:32,467 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 2768 transitions. [2019-12-18 17:13:32,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:13:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2768 transitions. [2019-12-18 17:13:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 17:13:32,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:32,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:32,471 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-18 17:13:32,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:32,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170722151] [2019-12-18 17:13:32,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:32,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170722151] [2019-12-18 17:13:32,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:32,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:32,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331958552] [2019-12-18 17:13:32,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:32,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:32,534 INFO L87 Difference]: Start difference. First operand 1275 states and 2768 transitions. Second operand 3 states. [2019-12-18 17:13:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:32,586 INFO L93 Difference]: Finished difference Result 1629 states and 3493 transitions. [2019-12-18 17:13:32,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:32,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 17:13:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:32,591 INFO L225 Difference]: With dead ends: 1629 [2019-12-18 17:13:32,591 INFO L226 Difference]: Without dead ends: 1629 [2019-12-18 17:13:32,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-18 17:13:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1344. [2019-12-18 17:13:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2019-12-18 17:13:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2924 transitions. [2019-12-18 17:13:32,656 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2924 transitions. Word has length 50 [2019-12-18 17:13:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:32,656 INFO L462 AbstractCegarLoop]: Abstraction has 1344 states and 2924 transitions. [2019-12-18 17:13:32,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2924 transitions. [2019-12-18 17:13:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 17:13:32,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:32,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:32,660 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:32,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-18 17:13:32,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:32,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69585935] [2019-12-18 17:13:32,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:32,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69585935] [2019-12-18 17:13:32,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:32,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:13:32,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096159105] [2019-12-18 17:13:32,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:13:32,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:13:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:13:32,906 INFO L87 Difference]: Start difference. First operand 1344 states and 2924 transitions. Second operand 10 states. [2019-12-18 17:13:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:33,886 INFO L93 Difference]: Finished difference Result 1933 states and 4015 transitions. [2019-12-18 17:13:33,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:13:33,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-18 17:13:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:33,891 INFO L225 Difference]: With dead ends: 1933 [2019-12-18 17:13:33,891 INFO L226 Difference]: Without dead ends: 1933 [2019-12-18 17:13:33,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:13:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-18 17:13:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1254. [2019-12-18 17:13:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-12-18 17:13:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 2686 transitions. [2019-12-18 17:13:33,922 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 2686 transitions. Word has length 51 [2019-12-18 17:13:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:33,923 INFO L462 AbstractCegarLoop]: Abstraction has 1254 states and 2686 transitions. [2019-12-18 17:13:33,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:13:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 2686 transitions. [2019-12-18 17:13:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 17:13:33,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:33,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:33,926 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-18 17:13:33,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:33,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395362797] [2019-12-18 17:13:33,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:13:33,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395362797] [2019-12-18 17:13:33,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:33,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:13:33,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201257885] [2019-12-18 17:13:33,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:33,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:33,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:33,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:33,997 INFO L87 Difference]: Start difference. First operand 1254 states and 2686 transitions. Second operand 3 states. [2019-12-18 17:13:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:13:34,014 INFO L93 Difference]: Finished difference Result 1253 states and 2684 transitions. [2019-12-18 17:13:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:13:34,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 17:13:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:13:34,017 INFO L225 Difference]: With dead ends: 1253 [2019-12-18 17:13:34,017 INFO L226 Difference]: Without dead ends: 1253 [2019-12-18 17:13:34,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-12-18 17:13:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 995. [2019-12-18 17:13:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-18 17:13:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2166 transitions. [2019-12-18 17:13:34,037 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2166 transitions. Word has length 51 [2019-12-18 17:13:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:13:34,038 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2166 transitions. [2019-12-18 17:13:34,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:13:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2166 transitions. [2019-12-18 17:13:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:13:34,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:34,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:13:34,041 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:34,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-18 17:13:34,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:34,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733640334] [2019-12-18 17:13:34,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:13:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:13:34,200 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:13:34,201 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:13:34,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t907~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 |v_ULTIMATE.start_main_~#t907~0.offset_24|) (= 0 v_~z$flush_delayed~0_37) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t907~0.base_35| 4) |v_#length_15|) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35|) |v_ULTIMATE.start_main_~#t907~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35| 1)) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35|)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t907~0.offset=|v_ULTIMATE.start_main_~#t907~0.offset_24|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t907~0.base=|v_ULTIMATE.start_main_~#t907~0.base_35|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t907~0.offset, ULTIMATE.start_main_~#t908~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t908~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t907~0.base, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 17:13:34,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t908~0.base_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13|) |v_ULTIMATE.start_main_~#t908~0.offset_11| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t908~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t908~0.base_13| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t908~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_11|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t908~0.offset, ULTIMATE.start_main_~#t908~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 17:13:34,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= (mod ~z$w_buff1_used~0_Out1093550782 256) 0) (= ~z$w_buff0_used~0_Out1093550782 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1093550782| 1) (= ~z$w_buff1~0_Out1093550782 ~z$w_buff0~0_In1093550782) (= ~z$w_buff0~0_Out1093550782 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1093550782| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1093550782) (= |P0Thread1of1ForFork0_#in~arg.base_In1093550782| P0Thread1of1ForFork0_~arg.base_Out1093550782) (= P0Thread1of1ForFork0_~arg.offset_Out1093550782 |P0Thread1of1ForFork0_#in~arg.offset_In1093550782|) (= ~z$w_buff0_used~0_In1093550782 ~z$w_buff1_used~0_Out1093550782)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1093550782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1093550782, ~z$w_buff0~0=~z$w_buff0~0_In1093550782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1093550782|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1093550782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1093550782, ~z$w_buff0~0=~z$w_buff0~0_Out1093550782, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1093550782, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1093550782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1093550782|, ~z$w_buff1~0=~z$w_buff1~0_Out1093550782, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1093550782, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1093550782|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1093550782} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:13:34,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2064443030 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-2064443030| ~z$w_buff1_used~0_In-2064443030) (= |P1Thread1of1ForFork1_#t~ite24_Out-2064443030| |P1Thread1of1ForFork1_#t~ite23_Out-2064443030|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2064443030 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-2064443030 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-2064443030 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In-2064443030 256)) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite23_In-2064443030| |P1Thread1of1ForFork1_#t~ite23_Out-2064443030|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-2064443030| ~z$w_buff1_used~0_In-2064443030)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2064443030, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2064443030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2064443030, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2064443030|, ~weak$$choice2~0=~weak$$choice2~0_In-2064443030, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2064443030} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2064443030, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2064443030, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2064443030|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2064443030, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2064443030|, ~weak$$choice2~0=~weak$$choice2~0_In-2064443030, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2064443030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 17:13:34,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 17:13:34,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:13:34,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-942398723 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-942398723 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-942398723|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-942398723 |P0Thread1of1ForFork0_#t~ite5_Out-942398723|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-942398723, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-942398723} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-942398723|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-942398723, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-942398723} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:13:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1932592262 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1932592262 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1932592262 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1932592262 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1932592262| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1932592262| ~z$w_buff1_used~0_In-1932592262) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1932592262, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1932592262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1932592262, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1932592262} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1932592262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1932592262, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1932592262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1932592262, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1932592262} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:13:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In80824328 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In80824328 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In80824328 ~z$r_buff0_thd1~0_Out80824328) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out80824328) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In80824328, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In80824328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In80824328, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out80824328|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out80824328} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:13:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-71853815 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-71853815 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-71853815 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-71853815 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-71853815|)) (and (= ~z$r_buff1_thd1~0_In-71853815 |P0Thread1of1ForFork0_#t~ite8_Out-71853815|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-71853815, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-71853815, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-71853815, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-71853815} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-71853815, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-71853815|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-71853815, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-71853815, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-71853815} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:13:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In983503122 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out983503122| |P1Thread1of1ForFork1_#t~ite32_Out983503122|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In983503122 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In983503122 |P1Thread1of1ForFork1_#t~ite32_Out983503122|)) (and (not .cse1) .cse0 (not .cse2) (= ~z$w_buff1~0_In983503122 |P1Thread1of1ForFork1_#t~ite32_Out983503122|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In983503122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983503122, ~z$w_buff1~0=~z$w_buff1~0_In983503122, ~z~0=~z~0_In983503122} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In983503122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983503122, ~z$w_buff1~0=~z$w_buff1~0_In983503122, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out983503122|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out983503122|, ~z~0=~z~0_In983503122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 17:13:34,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1294996968 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1294996968 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1294996968| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1294996968| ~z$w_buff0_used~0_In1294996968)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1294996968, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1294996968} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1294996968, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1294996968|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1294996968} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 17:13:34,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-558001927 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-558001927 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-558001927 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-558001927 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-558001927| ~z$w_buff1_used~0_In-558001927) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-558001927|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-558001927, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-558001927, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-558001927, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-558001927} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-558001927, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-558001927, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-558001927, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-558001927|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-558001927} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 17:13:34,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-54467078 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-54467078 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-54467078|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-54467078 |P1Thread1of1ForFork1_#t~ite36_Out-54467078|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-54467078, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-54467078} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-54467078, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-54467078, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-54467078|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 17:13:34,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2104715801 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-2104715801 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2104715801 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-2104715801 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-2104715801| ~z$r_buff1_thd2~0_In-2104715801) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2104715801| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2104715801, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2104715801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2104715801, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2104715801} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2104715801, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2104715801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2104715801, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2104715801, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2104715801|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 17:13:34,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 17:13:34,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:13:34,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 17:13:34,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In216570177 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In216570177 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out216570177| ~z~0_In216570177)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out216570177| ~z$w_buff1~0_In216570177)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In216570177, ~z$w_buff1_used~0=~z$w_buff1_used~0_In216570177, ~z$w_buff1~0=~z$w_buff1~0_In216570177, ~z~0=~z~0_In216570177} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out216570177|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In216570177, ~z$w_buff1_used~0=~z$w_buff1_used~0_In216570177, ~z$w_buff1~0=~z$w_buff1~0_In216570177, ~z~0=~z~0_In216570177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:13:34,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-18 17:13:34,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1157120985 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1157120985 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1157120985| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1157120985| ~z$w_buff0_used~0_In-1157120985)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1157120985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1157120985} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1157120985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1157120985, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1157120985|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:13:34,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In98662112 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In98662112 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In98662112 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In98662112 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In98662112 |ULTIMATE.start_main_#t~ite43_Out98662112|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out98662112|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In98662112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In98662112, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In98662112, ~z$w_buff1_used~0=~z$w_buff1_used~0_In98662112} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In98662112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In98662112, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In98662112, ~z$w_buff1_used~0=~z$w_buff1_used~0_In98662112, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out98662112|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 17:13:34,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-810464985 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-810464985 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-810464985|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-810464985 |ULTIMATE.start_main_#t~ite44_Out-810464985|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-810464985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-810464985} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-810464985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-810464985, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-810464985|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:13:34,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1778806139 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1778806139 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1778806139 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1778806139 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1778806139| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1778806139| ~z$r_buff1_thd0~0_In-1778806139)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1778806139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1778806139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1778806139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778806139} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1778806139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1778806139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1778806139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778806139, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1778806139|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:13:34,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:13:34,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:13:34 BasicIcfg [2019-12-18 17:13:34,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:13:34,363 INFO L168 Benchmark]: Toolchain (without parser) took 14553.20 ms. Allocated memory was 137.9 MB in the beginning and 440.9 MB in the end (delta: 303.0 MB). Free memory was 101.3 MB in the beginning and 142.2 MB in the end (delta: -40.9 MB). Peak memory consumption was 262.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:34,364 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 17:13:34,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.75 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 156.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:34,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.91 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:34,369 INFO L168 Benchmark]: Boogie Preprocessor took 40.35 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:34,369 INFO L168 Benchmark]: RCFGBuilder took 772.59 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 107.4 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:34,374 INFO L168 Benchmark]: TraceAbstraction took 12882.73 ms. Allocated memory was 202.4 MB in the beginning and 440.9 MB in the end (delta: 238.6 MB). Free memory was 106.7 MB in the beginning and 142.2 MB in the end (delta: -35.5 MB). Peak memory consumption was 203.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:13:34,383 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.46 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.75 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 156.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.91 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.35 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 772.59 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 107.4 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12882.73 ms. Allocated memory was 202.4 MB in the beginning and 440.9 MB in the end (delta: 238.6 MB). Free memory was 106.7 MB in the beginning and 142.2 MB in the end (delta: -35.5 MB). Peak memory consumption was 203.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t907, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L806] FCALL, FORK 0 pthread_create(&t908, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L815] 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 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1786 SDtfs, 1408 SDslu, 3431 SDs, 0 SdLazy, 2197 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4186 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 54475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...