/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:24:14,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:24:14,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:24:14,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:24:14,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:24:14,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:24:14,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:24:14,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:24:14,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:24:14,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:24:14,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:24:14,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:24:14,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:24:14,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:24:14,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:24:14,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:24:14,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:24:14,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:24:14,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:24:14,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:24:14,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:24:14,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:24:14,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:24:14,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:24:14,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:24:14,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:24:14,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:24:14,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:24:14,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:24:14,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:24:14,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:24:14,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:24:14,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:24:14,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:24:14,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:24:14,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:24:14,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:24:14,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:24:14,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:24:14,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:24:14,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:24:14,514 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-VariableLbe.epf [2019-12-27 05:24:14,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:24:14,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:24:14,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:24:14,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:24:14,531 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:24:14,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:24:14,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:24:14,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:24:14,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:24:14,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:24:14,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:24:14,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:24:14,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:24:14,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:24:14,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:24:14,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:24:14,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:24:14,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:24:14,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:24:14,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:24:14,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:24:14,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:24:14,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:24:14,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:24:14,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:24:14,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:24:14,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:24:14,537 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:24:14,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:24:14,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:24:14,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:24:14,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:24:14,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:24:14,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:24:14,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:24:14,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-27 05:24:14,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8f91775/11c9e67f25224096a4dabcd1eec18780/FLAG4bf08a726 [2019-12-27 05:24:15,463 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:24:15,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-27 05:24:15,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8f91775/11c9e67f25224096a4dabcd1eec18780/FLAG4bf08a726 [2019-12-27 05:24:15,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8f91775/11c9e67f25224096a4dabcd1eec18780 [2019-12-27 05:24:15,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:24:15,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:24:15,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:24:15,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:24:15,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:24:15,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:24:15" (1/1) ... [2019-12-27 05:24:15,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:15, skipping insertion in model container [2019-12-27 05:24:15,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:24:15" (1/1) ... [2019-12-27 05:24:15,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:24:15,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:24:16,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:24:16,443 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:24:16,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:24:16,609 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:24:16,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16 WrapperNode [2019-12-27 05:24:16,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:24:16,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:24:16,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:24:16,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:24:16,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:24:16,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:24:16,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:24:16,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:24:16,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... [2019-12-27 05:24:16,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:24:16,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:24:16,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:24:16,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:24:16,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:24:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:24:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:24:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:24:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:24:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:24:16,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:24:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:24:16,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:24:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:24:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:24:16,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:24:16,806 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:24:17,767 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:24:17,768 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:24:17,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:24:17 BoogieIcfgContainer [2019-12-27 05:24:17,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:24:17,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:24:17,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:24:17,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:24:17,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:24:15" (1/3) ... [2019-12-27 05:24:17,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518a6cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:24:17, skipping insertion in model container [2019-12-27 05:24:17,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:16" (2/3) ... [2019-12-27 05:24:17,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518a6cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:24:17, skipping insertion in model container [2019-12-27 05:24:17,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:24:17" (3/3) ... [2019-12-27 05:24:17,778 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_tso.opt.i [2019-12-27 05:24:17,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:24:17,789 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:24:17,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:24:17,798 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:24:17,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:17,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:24:17,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:24:17,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:24:17,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:24:17,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:24:17,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:24:17,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:24:17,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:24:17,992 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:24:18,009 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-27 05:24:18,011 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 05:24:18,144 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 05:24:18,144 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:24:18,168 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 05:24:18,199 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 05:24:18,268 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 05:24:18,268 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:24:18,279 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 05:24:18,307 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 05:24:18,308 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:24:21,823 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 05:24:21,960 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 05:24:22,008 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131854 [2019-12-27 05:24:22,008 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 05:24:22,012 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 132 transitions [2019-12-27 05:24:23,679 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26534 states. [2019-12-27 05:24:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 26534 states. [2019-12-27 05:24:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 05:24:23,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:23,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 05:24:23,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:23,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:23,695 INFO L82 PathProgramCache]: Analyzing trace with hash 953057354, now seen corresponding path program 1 times [2019-12-27 05:24:23,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:23,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662448134] [2019-12-27 05:24:23,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:23,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662448134] [2019-12-27 05:24:23,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:23,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:24:23,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275871399] [2019-12-27 05:24:23,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:23,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:23,951 INFO L87 Difference]: Start difference. First operand 26534 states. Second operand 3 states. [2019-12-27 05:24:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:24,496 INFO L93 Difference]: Finished difference Result 26194 states and 94183 transitions. [2019-12-27 05:24:24,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:24,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 05:24:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:25,483 INFO L225 Difference]: With dead ends: 26194 [2019-12-27 05:24:25,484 INFO L226 Difference]: Without dead ends: 24502 [2019-12-27 05:24:25,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24502 states. [2019-12-27 05:24:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24502 to 24502. [2019-12-27 05:24:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24502 states. [2019-12-27 05:24:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24502 states to 24502 states and 88039 transitions. [2019-12-27 05:24:26,853 INFO L78 Accepts]: Start accepts. Automaton has 24502 states and 88039 transitions. Word has length 5 [2019-12-27 05:24:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:26,853 INFO L462 AbstractCegarLoop]: Abstraction has 24502 states and 88039 transitions. [2019-12-27 05:24:26,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 24502 states and 88039 transitions. [2019-12-27 05:24:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:24:26,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:26,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:26,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1380440387, now seen corresponding path program 1 times [2019-12-27 05:24:26,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:26,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020824281] [2019-12-27 05:24:26,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:26,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020824281] [2019-12-27 05:24:26,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:26,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:26,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849023425] [2019-12-27 05:24:26,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:26,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:26,975 INFO L87 Difference]: Start difference. First operand 24502 states and 88039 transitions. Second operand 4 states. [2019-12-27 05:24:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:27,934 INFO L93 Difference]: Finished difference Result 37826 states and 129915 transitions. [2019-12-27 05:24:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:27,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:24:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:28,116 INFO L225 Difference]: With dead ends: 37826 [2019-12-27 05:24:28,116 INFO L226 Difference]: Without dead ends: 37810 [2019-12-27 05:24:28,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37810 states. [2019-12-27 05:24:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37810 to 36886. [2019-12-27 05:24:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36886 states. [2019-12-27 05:24:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36886 states to 36886 states and 127503 transitions. [2019-12-27 05:24:31,056 INFO L78 Accepts]: Start accepts. Automaton has 36886 states and 127503 transitions. Word has length 11 [2019-12-27 05:24:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:31,057 INFO L462 AbstractCegarLoop]: Abstraction has 36886 states and 127503 transitions. [2019-12-27 05:24:31,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36886 states and 127503 transitions. [2019-12-27 05:24:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:24:31,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:31,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:31,063 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2090130903, now seen corresponding path program 1 times [2019-12-27 05:24:31,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:31,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398612339] [2019-12-27 05:24:31,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:31,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398612339] [2019-12-27 05:24:31,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:31,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:31,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168793049] [2019-12-27 05:24:31,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:31,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:31,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:31,138 INFO L87 Difference]: Start difference. First operand 36886 states and 127503 transitions. Second operand 4 states. [2019-12-27 05:24:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:31,631 INFO L93 Difference]: Finished difference Result 46955 states and 159667 transitions. [2019-12-27 05:24:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:31,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:24:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:31,770 INFO L225 Difference]: With dead ends: 46955 [2019-12-27 05:24:31,770 INFO L226 Difference]: Without dead ends: 46941 [2019-12-27 05:24:31,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46941 states. [2019-12-27 05:24:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46941 to 42372. [2019-12-27 05:24:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42372 states. [2019-12-27 05:24:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42372 states to 42372 states and 145521 transitions. [2019-12-27 05:24:34,436 INFO L78 Accepts]: Start accepts. Automaton has 42372 states and 145521 transitions. Word has length 14 [2019-12-27 05:24:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:34,437 INFO L462 AbstractCegarLoop]: Abstraction has 42372 states and 145521 transitions. [2019-12-27 05:24:34,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42372 states and 145521 transitions. [2019-12-27 05:24:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:24:34,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:34,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:34,442 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:34,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:34,442 INFO L82 PathProgramCache]: Analyzing trace with hash -369520138, now seen corresponding path program 1 times [2019-12-27 05:24:34,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:34,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569208800] [2019-12-27 05:24:34,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:34,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569208800] [2019-12-27 05:24:34,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:34,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:34,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239724978] [2019-12-27 05:24:34,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:34,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:34,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:34,511 INFO L87 Difference]: Start difference. First operand 42372 states and 145521 transitions. Second operand 3 states. [2019-12-27 05:24:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:34,825 INFO L93 Difference]: Finished difference Result 70468 states and 231072 transitions. [2019-12-27 05:24:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:34,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 05:24:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:35,019 INFO L225 Difference]: With dead ends: 70468 [2019-12-27 05:24:35,020 INFO L226 Difference]: Without dead ends: 70468 [2019-12-27 05:24:35,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70468 states. [2019-12-27 05:24:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70468 to 62872. [2019-12-27 05:24:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62872 states. [2019-12-27 05:24:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62872 states to 62872 states and 209460 transitions. [2019-12-27 05:24:37,408 INFO L78 Accepts]: Start accepts. Automaton has 62872 states and 209460 transitions. Word has length 15 [2019-12-27 05:24:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:37,409 INFO L462 AbstractCegarLoop]: Abstraction has 62872 states and 209460 transitions. [2019-12-27 05:24:37,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 62872 states and 209460 transitions. [2019-12-27 05:24:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:24:37,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:37,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:37,413 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:37,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:37,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1639009254, now seen corresponding path program 1 times [2019-12-27 05:24:37,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:37,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54535764] [2019-12-27 05:24:37,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:37,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54535764] [2019-12-27 05:24:37,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:37,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:24:37,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315572408] [2019-12-27 05:24:37,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:37,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:37,471 INFO L87 Difference]: Start difference. First operand 62872 states and 209460 transitions. Second operand 3 states. [2019-12-27 05:24:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:39,587 INFO L93 Difference]: Finished difference Result 59416 states and 197713 transitions. [2019-12-27 05:24:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:39,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:24:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:39,733 INFO L225 Difference]: With dead ends: 59416 [2019-12-27 05:24:39,734 INFO L226 Difference]: Without dead ends: 59093 [2019-12-27 05:24:39,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59093 states. [2019-12-27 05:24:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59093 to 59093. [2019-12-27 05:24:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59093 states. [2019-12-27 05:24:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59093 states to 59093 states and 196717 transitions. [2019-12-27 05:24:41,199 INFO L78 Accepts]: Start accepts. Automaton has 59093 states and 196717 transitions. Word has length 16 [2019-12-27 05:24:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:41,199 INFO L462 AbstractCegarLoop]: Abstraction has 59093 states and 196717 transitions. [2019-12-27 05:24:41,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 59093 states and 196717 transitions. [2019-12-27 05:24:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 05:24:41,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:41,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:41,209 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2035304780, now seen corresponding path program 1 times [2019-12-27 05:24:41,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:41,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827809382] [2019-12-27 05:24:41,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:41,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827809382] [2019-12-27 05:24:41,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:41,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:41,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628199104] [2019-12-27 05:24:41,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:41,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:41,274 INFO L87 Difference]: Start difference. First operand 59093 states and 196717 transitions. Second operand 4 states. [2019-12-27 05:24:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:41,838 INFO L93 Difference]: Finished difference Result 72866 states and 238915 transitions. [2019-12-27 05:24:41,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:41,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 05:24:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:42,495 INFO L225 Difference]: With dead ends: 72866 [2019-12-27 05:24:42,495 INFO L226 Difference]: Without dead ends: 72849 [2019-12-27 05:24:42,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72849 states. [2019-12-27 05:24:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72849 to 59871. [2019-12-27 05:24:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59871 states. [2019-12-27 05:24:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59871 states to 59871 states and 199251 transitions. [2019-12-27 05:24:46,151 INFO L78 Accepts]: Start accepts. Automaton has 59871 states and 199251 transitions. Word has length 17 [2019-12-27 05:24:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:46,151 INFO L462 AbstractCegarLoop]: Abstraction has 59871 states and 199251 transitions. [2019-12-27 05:24:46,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 59871 states and 199251 transitions. [2019-12-27 05:24:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 05:24:46,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:46,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:46,164 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash -610432844, now seen corresponding path program 1 times [2019-12-27 05:24:46,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:46,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180813198] [2019-12-27 05:24:46,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:46,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180813198] [2019-12-27 05:24:46,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:46,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:46,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388711314] [2019-12-27 05:24:46,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:46,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:46,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:46,232 INFO L87 Difference]: Start difference. First operand 59871 states and 199251 transitions. Second operand 5 states. [2019-12-27 05:24:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:47,159 INFO L93 Difference]: Finished difference Result 84003 states and 272461 transitions. [2019-12-27 05:24:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:24:47,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 05:24:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:47,313 INFO L225 Difference]: With dead ends: 84003 [2019-12-27 05:24:47,313 INFO L226 Difference]: Without dead ends: 83989 [2019-12-27 05:24:47,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:24:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83989 states. [2019-12-27 05:24:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83989 to 65331. [2019-12-27 05:24:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65331 states. [2019-12-27 05:24:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65331 states to 65331 states and 216301 transitions. [2019-12-27 05:24:49,296 INFO L78 Accepts]: Start accepts. Automaton has 65331 states and 216301 transitions. Word has length 20 [2019-12-27 05:24:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:49,296 INFO L462 AbstractCegarLoop]: Abstraction has 65331 states and 216301 transitions. [2019-12-27 05:24:49,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 65331 states and 216301 transitions. [2019-12-27 05:24:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 05:24:49,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:49,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:49,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash -217091173, now seen corresponding path program 1 times [2019-12-27 05:24:49,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:49,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012242827] [2019-12-27 05:24:49,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:49,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012242827] [2019-12-27 05:24:49,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:49,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:49,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292268829] [2019-12-27 05:24:49,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:49,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:49,387 INFO L87 Difference]: Start difference. First operand 65331 states and 216301 transitions. Second operand 4 states. [2019-12-27 05:24:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:49,965 INFO L93 Difference]: Finished difference Result 11962 states and 32112 transitions. [2019-12-27 05:24:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:24:49,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 05:24:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:49,977 INFO L225 Difference]: With dead ends: 11962 [2019-12-27 05:24:49,978 INFO L226 Difference]: Without dead ends: 7410 [2019-12-27 05:24:49,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7410 states. [2019-12-27 05:24:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7410 to 7362. [2019-12-27 05:24:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7362 states. [2019-12-27 05:24:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 17120 transitions. [2019-12-27 05:24:50,077 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 17120 transitions. Word has length 23 [2019-12-27 05:24:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:50,077 INFO L462 AbstractCegarLoop]: Abstraction has 7362 states and 17120 transitions. [2019-12-27 05:24:50,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 17120 transitions. [2019-12-27 05:24:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 05:24:50,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:50,082 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] [2019-12-27 05:24:50,082 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:50,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:50,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1288158756, now seen corresponding path program 1 times [2019-12-27 05:24:50,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:50,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198867482] [2019-12-27 05:24:50,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:50,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198867482] [2019-12-27 05:24:50,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:50,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:50,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306493607] [2019-12-27 05:24:50,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:50,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:50,144 INFO L87 Difference]: Start difference. First operand 7362 states and 17120 transitions. Second operand 3 states. [2019-12-27 05:24:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:50,225 INFO L93 Difference]: Finished difference Result 8021 states and 17640 transitions. [2019-12-27 05:24:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:50,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 05:24:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:50,236 INFO L225 Difference]: With dead ends: 8021 [2019-12-27 05:24:50,236 INFO L226 Difference]: Without dead ends: 8021 [2019-12-27 05:24:50,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8021 states. [2019-12-27 05:24:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8021 to 7419. [2019-12-27 05:24:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7419 states. [2019-12-27 05:24:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7419 states to 7419 states and 16391 transitions. [2019-12-27 05:24:50,323 INFO L78 Accepts]: Start accepts. Automaton has 7419 states and 16391 transitions. Word has length 31 [2019-12-27 05:24:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:50,323 INFO L462 AbstractCegarLoop]: Abstraction has 7419 states and 16391 transitions. [2019-12-27 05:24:50,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 7419 states and 16391 transitions. [2019-12-27 05:24:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:24:50,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:50,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:50,330 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1169223524, now seen corresponding path program 1 times [2019-12-27 05:24:50,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:50,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518544182] [2019-12-27 05:24:50,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:50,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518544182] [2019-12-27 05:24:50,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:50,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:50,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692382343] [2019-12-27 05:24:50,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:50,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:50,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:50,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:50,434 INFO L87 Difference]: Start difference. First operand 7419 states and 16391 transitions. Second operand 5 states. [2019-12-27 05:24:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:50,846 INFO L93 Difference]: Finished difference Result 8342 states and 18150 transitions. [2019-12-27 05:24:50,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:24:50,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 05:24:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:50,857 INFO L225 Difference]: With dead ends: 8342 [2019-12-27 05:24:50,857 INFO L226 Difference]: Without dead ends: 8341 [2019-12-27 05:24:50,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:24:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2019-12-27 05:24:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 6561. [2019-12-27 05:24:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2019-12-27 05:24:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 14656 transitions. [2019-12-27 05:24:50,935 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 14656 transitions. Word has length 34 [2019-12-27 05:24:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:50,936 INFO L462 AbstractCegarLoop]: Abstraction has 6561 states and 14656 transitions. [2019-12-27 05:24:50,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 14656 transitions. [2019-12-27 05:24:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:24:50,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:50,943 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] [2019-12-27 05:24:50,944 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash -199933436, now seen corresponding path program 1 times [2019-12-27 05:24:50,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:50,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841274713] [2019-12-27 05:24:50,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:51,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841274713] [2019-12-27 05:24:51,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:51,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:51,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736152264] [2019-12-27 05:24:51,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:51,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:51,031 INFO L87 Difference]: Start difference. First operand 6561 states and 14656 transitions. Second operand 5 states. [2019-12-27 05:24:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:51,166 INFO L93 Difference]: Finished difference Result 9723 states and 21829 transitions. [2019-12-27 05:24:51,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:24:51,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:24:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:51,179 INFO L225 Difference]: With dead ends: 9723 [2019-12-27 05:24:51,179 INFO L226 Difference]: Without dead ends: 7827 [2019-12-27 05:24:51,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:24:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2019-12-27 05:24:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 7827. [2019-12-27 05:24:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7827 states. [2019-12-27 05:24:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7827 states to 7827 states and 17603 transitions. [2019-12-27 05:24:51,313 INFO L78 Accepts]: Start accepts. Automaton has 7827 states and 17603 transitions. Word has length 41 [2019-12-27 05:24:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:51,313 INFO L462 AbstractCegarLoop]: Abstraction has 7827 states and 17603 transitions. [2019-12-27 05:24:51,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7827 states and 17603 transitions. [2019-12-27 05:24:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:24:51,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:51,326 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] [2019-12-27 05:24:51,326 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash 729473288, now seen corresponding path program 1 times [2019-12-27 05:24:51,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:51,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69878526] [2019-12-27 05:24:51,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:51,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69878526] [2019-12-27 05:24:51,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:51,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:24:51,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566602403] [2019-12-27 05:24:51,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:51,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:51,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:51,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:51,404 INFO L87 Difference]: Start difference. First operand 7827 states and 17603 transitions. Second operand 5 states. [2019-12-27 05:24:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:51,856 INFO L93 Difference]: Finished difference Result 8964 states and 19904 transitions. [2019-12-27 05:24:51,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:24:51,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 05:24:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:51,866 INFO L225 Difference]: With dead ends: 8964 [2019-12-27 05:24:51,866 INFO L226 Difference]: Without dead ends: 8964 [2019-12-27 05:24:51,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:24:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8964 states. [2019-12-27 05:24:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8964 to 8619. [2019-12-27 05:24:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8619 states. [2019-12-27 05:24:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8619 states to 8619 states and 19234 transitions. [2019-12-27 05:24:51,955 INFO L78 Accepts]: Start accepts. Automaton has 8619 states and 19234 transitions. Word has length 42 [2019-12-27 05:24:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:51,955 INFO L462 AbstractCegarLoop]: Abstraction has 8619 states and 19234 transitions. [2019-12-27 05:24:51,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8619 states and 19234 transitions. [2019-12-27 05:24:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 05:24:51,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:51,965 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] [2019-12-27 05:24:51,965 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:51,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1524647087, now seen corresponding path program 1 times [2019-12-27 05:24:51,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:51,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769689708] [2019-12-27 05:24:51,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:52,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769689708] [2019-12-27 05:24:52,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:52,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:24:52,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363327620] [2019-12-27 05:24:52,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:52,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:52,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:52,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:52,057 INFO L87 Difference]: Start difference. First operand 8619 states and 19234 transitions. Second operand 5 states. [2019-12-27 05:24:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:52,519 INFO L93 Difference]: Finished difference Result 9519 states and 20886 transitions. [2019-12-27 05:24:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:24:52,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 05:24:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:52,534 INFO L225 Difference]: With dead ends: 9519 [2019-12-27 05:24:52,534 INFO L226 Difference]: Without dead ends: 9519 [2019-12-27 05:24:52,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:24:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9519 states. [2019-12-27 05:24:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9519 to 8582. [2019-12-27 05:24:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8582 states. [2019-12-27 05:24:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 18775 transitions. [2019-12-27 05:24:52,675 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 18775 transitions. Word has length 43 [2019-12-27 05:24:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:52,675 INFO L462 AbstractCegarLoop]: Abstraction has 8582 states and 18775 transitions. [2019-12-27 05:24:52,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 18775 transitions. [2019-12-27 05:24:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 05:24:52,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:52,688 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] [2019-12-27 05:24:52,689 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash 4854504, now seen corresponding path program 1 times [2019-12-27 05:24:52,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:52,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046546367] [2019-12-27 05:24:52,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:52,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046546367] [2019-12-27 05:24:52,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:52,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:24:52,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273794990] [2019-12-27 05:24:52,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:52,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:52,762 INFO L87 Difference]: Start difference. First operand 8582 states and 18775 transitions. Second operand 5 states. [2019-12-27 05:24:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:52,834 INFO L93 Difference]: Finished difference Result 5737 states and 12430 transitions. [2019-12-27 05:24:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:52,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 05:24:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:52,841 INFO L225 Difference]: With dead ends: 5737 [2019-12-27 05:24:52,841 INFO L226 Difference]: Without dead ends: 5409 [2019-12-27 05:24:52,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:24:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-12-27 05:24:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5124. [2019-12-27 05:24:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-12-27 05:24:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 11217 transitions. [2019-12-27 05:24:52,916 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 11217 transitions. Word has length 43 [2019-12-27 05:24:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:52,916 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 11217 transitions. [2019-12-27 05:24:52,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 11217 transitions. [2019-12-27 05:24:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:52,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:52,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:52,925 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 664606617, now seen corresponding path program 1 times [2019-12-27 05:24:52,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:52,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614276708] [2019-12-27 05:24:52,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:52,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614276708] [2019-12-27 05:24:52,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:52,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:52,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457889010] [2019-12-27 05:24:52,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:52,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:52,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:52,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:52,990 INFO L87 Difference]: Start difference. First operand 5124 states and 11217 transitions. Second operand 4 states. [2019-12-27 05:24:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:53,020 INFO L93 Difference]: Finished difference Result 5956 states and 12941 transitions. [2019-12-27 05:24:53,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:24:53,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 05:24:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:53,021 INFO L225 Difference]: With dead ends: 5956 [2019-12-27 05:24:53,022 INFO L226 Difference]: Without dead ends: 901 [2019-12-27 05:24:53,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-27 05:24:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2019-12-27 05:24:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-27 05:24:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1817 transitions. [2019-12-27 05:24:53,071 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1817 transitions. Word has length 59 [2019-12-27 05:24:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:53,071 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1817 transitions. [2019-12-27 05:24:53,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1817 transitions. [2019-12-27 05:24:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:53,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:53,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:53,074 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1824485506, now seen corresponding path program 1 times [2019-12-27 05:24:53,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:53,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152969758] [2019-12-27 05:24:53,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:53,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152969758] [2019-12-27 05:24:53,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:53,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:24:53,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055227189] [2019-12-27 05:24:53,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:24:53,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:24:53,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:24:53,234 INFO L87 Difference]: Start difference. First operand 901 states and 1817 transitions. Second operand 8 states. [2019-12-27 05:24:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:53,542 INFO L93 Difference]: Finished difference Result 1857 states and 3578 transitions. [2019-12-27 05:24:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:24:53,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 05:24:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:53,544 INFO L225 Difference]: With dead ends: 1857 [2019-12-27 05:24:53,544 INFO L226 Difference]: Without dead ends: 1326 [2019-12-27 05:24:53,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:24:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-27 05:24:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 952. [2019-12-27 05:24:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 05:24:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1893 transitions. [2019-12-27 05:24:53,558 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1893 transitions. Word has length 59 [2019-12-27 05:24:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:53,559 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1893 transitions. [2019-12-27 05:24:53,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:24:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1893 transitions. [2019-12-27 05:24:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:53,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:53,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:53,561 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1605661378, now seen corresponding path program 2 times [2019-12-27 05:24:53,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:53,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538935907] [2019-12-27 05:24:53,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:53,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538935907] [2019-12-27 05:24:53,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:53,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:24:53,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952864244] [2019-12-27 05:24:53,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:24:53,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:24:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:24:53,746 INFO L87 Difference]: Start difference. First operand 952 states and 1893 transitions. Second operand 10 states. [2019-12-27 05:24:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:54,362 INFO L93 Difference]: Finished difference Result 1470 states and 2832 transitions. [2019-12-27 05:24:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:24:54,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 05:24:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:54,364 INFO L225 Difference]: With dead ends: 1470 [2019-12-27 05:24:54,365 INFO L226 Difference]: Without dead ends: 1470 [2019-12-27 05:24:54,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:24:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-12-27 05:24:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 961. [2019-12-27 05:24:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-12-27 05:24:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1911 transitions. [2019-12-27 05:24:54,376 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1911 transitions. Word has length 59 [2019-12-27 05:24:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:54,376 INFO L462 AbstractCegarLoop]: Abstraction has 961 states and 1911 transitions. [2019-12-27 05:24:54,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:24:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1911 transitions. [2019-12-27 05:24:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:54,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:54,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:54,378 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash 695697502, now seen corresponding path program 3 times [2019-12-27 05:24:54,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:54,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842491321] [2019-12-27 05:24:54,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:54,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842491321] [2019-12-27 05:24:54,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:54,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:24:54,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222829783] [2019-12-27 05:24:54,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:24:54,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:24:54,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:24:54,463 INFO L87 Difference]: Start difference. First operand 961 states and 1911 transitions. Second operand 6 states. [2019-12-27 05:24:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:54,868 INFO L93 Difference]: Finished difference Result 1170 states and 2280 transitions. [2019-12-27 05:24:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:24:54,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 05:24:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:54,870 INFO L225 Difference]: With dead ends: 1170 [2019-12-27 05:24:54,870 INFO L226 Difference]: Without dead ends: 1170 [2019-12-27 05:24:54,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:24:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-27 05:24:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 991. [2019-12-27 05:24:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-27 05:24:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1966 transitions. [2019-12-27 05:24:54,889 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1966 transitions. Word has length 59 [2019-12-27 05:24:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:54,890 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1966 transitions. [2019-12-27 05:24:54,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:24:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1966 transitions. [2019-12-27 05:24:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:54,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:54,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:54,892 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1043077686, now seen corresponding path program 4 times [2019-12-27 05:24:54,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:54,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259449017] [2019-12-27 05:24:54,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:54,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259449017] [2019-12-27 05:24:54,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:54,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:54,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236957483] [2019-12-27 05:24:54,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:54,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:54,984 INFO L87 Difference]: Start difference. First operand 991 states and 1966 transitions. Second operand 3 states. [2019-12-27 05:24:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:54,997 INFO L93 Difference]: Finished difference Result 990 states and 1964 transitions. [2019-12-27 05:24:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:54,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 05:24:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:54,999 INFO L225 Difference]: With dead ends: 990 [2019-12-27 05:24:54,999 INFO L226 Difference]: Without dead ends: 990 [2019-12-27 05:24:54,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-27 05:24:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 847. [2019-12-27 05:24:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-27 05:24:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1701 transitions. [2019-12-27 05:24:55,011 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1701 transitions. Word has length 59 [2019-12-27 05:24:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:55,011 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1701 transitions. [2019-12-27 05:24:55,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1701 transitions. [2019-12-27 05:24:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 05:24:55,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:55,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:55,013 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash 385115502, now seen corresponding path program 1 times [2019-12-27 05:24:55,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:55,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904327379] [2019-12-27 05:24:55,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:24:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:24:55,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:24:55,159 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:24:55,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_130) (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$r_buff0_thd1~0_51) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~x$r_buff1_thd2~0_38 0) (= |v_#NULL.offset_3| 0) (= v_~x$flush_delayed~0_17 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t319~0.base_27| 4)) (= v_~x$r_buff1_thd0~0_23 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_36) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t319~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t319~0.base_27|) |v_ULTIMATE.start_main_~#t319~0.offset_21| 0))) (= |v_ULTIMATE.start_main_~#t319~0.offset_21| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t319~0.base_27|) 0) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_35) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_17) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t319~0.base_27|) (= v_~main$tmp_guard0~0_11 0) (= v_~x$r_buff1_thd1~0_27 0) (= 0 v_~x$r_buff0_thd2~0_75) (= 0 v_~x$w_buff1~0_30) (< 0 |v_#StackHeapBarrier_13|) (= (store .cse0 |v_ULTIMATE.start_main_~#t319~0.base_27| 1) |v_#valid_45|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t319~0.base=|v_ULTIMATE.start_main_~#t319~0.base_27|, ~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t319~0.offset=|v_ULTIMATE.start_main_~#t319~0.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, #length=|v_#length_19|, ~y~0=v_~y~0_9, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_14|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_38, ULTIMATE.start_main_~#t320~0.offset=|v_ULTIMATE.start_main_~#t320~0.offset_16|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_23, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ULTIMATE.start_main_~#t320~0.base=|v_ULTIMATE.start_main_~#t320~0.base_20|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_25|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t319~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t319~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t320~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t320~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 05:24:55,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L808-1-->L810: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t320~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t320~0.offset_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t320~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t320~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t320~0.base_11|) |v_ULTIMATE.start_main_~#t320~0.offset_11| 1)) |v_#memory_int_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t320~0.base_11| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t320~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t320~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t320~0.offset=|v_ULTIMATE.start_main_~#t320~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t320~0.base=|v_ULTIMATE.start_main_~#t320~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t320~0.offset, #length, ULTIMATE.start_main_~#t320~0.base] because there is no mapped edge [2019-12-27 05:24:55,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~x$w_buff1_used~0_51 256)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= v_~x$w_buff1_used~0_51 v_~x$w_buff0_used~0_89) (= 1 v_~x$w_buff0_used~0_88) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= 1 v_~x$w_buff0~0_18)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 05:24:55,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In651586982 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In651586982 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out651586982| ~x$w_buff0~0_In651586982) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff1~0_In651586982 |P1Thread1of1ForFork1_#t~ite28_Out651586982|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In651586982, ~x$w_buff1~0=~x$w_buff1~0_In651586982, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651586982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651586982} OutVars{~x$w_buff0~0=~x$w_buff0~0_In651586982, ~x$w_buff1~0=~x$w_buff1~0_In651586982, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In651586982, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out651586982|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In651586982} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:24:55,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_21 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~x~0=v_~x~0_21, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:24:55,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_64 v_~x$r_buff0_thd2~0_63) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_9|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_8|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_10|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 05:24:55,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In629314730 256) 0))) (or (and (= ~x$mem_tmp~0_In629314730 |P1Thread1of1ForFork1_#t~ite48_Out629314730|) (not .cse0)) (and (= ~x~0_In629314730 |P1Thread1of1ForFork1_#t~ite48_Out629314730|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In629314730, ~x$mem_tmp~0=~x$mem_tmp~0_In629314730, ~x~0=~x~0_In629314730} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In629314730, ~x$mem_tmp~0=~x$mem_tmp~0_In629314730, ~x~0=~x~0_In629314730, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out629314730|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 05:24:55,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-98528708 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-98528708| ~x$mem_tmp~0_In-98528708) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-98528708| ~x~0_In-98528708)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-98528708, ~x$mem_tmp~0=~x$mem_tmp~0_In-98528708, ~x~0=~x~0_In-98528708} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-98528708|, ~x$flush_delayed~0=~x$flush_delayed~0_In-98528708, ~x$mem_tmp~0=~x$mem_tmp~0_In-98528708, ~x~0=~x~0_In-98528708} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 05:24:55,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= v_~x~0_24 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= v_~x$flush_delayed~0_12 0) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 05:24:55,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-580927104 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-580927104 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-580927104|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-580927104| ~x$w_buff0_used~0_In-580927104) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-580927104, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580927104} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-580927104|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-580927104, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580927104} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 05:24:55,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In365778188 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In365778188 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In365778188 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In365778188 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite52_Out365778188| ~x$w_buff1_used~0_In365778188) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out365778188| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In365778188, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In365778188, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In365778188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In365778188} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out365778188|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In365778188, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In365778188, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In365778188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In365778188} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 05:24:55,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In138771615 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In138771615 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out138771615 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In138771615 ~x$r_buff0_thd2~0_Out138771615)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In138771615, ~x$w_buff0_used~0=~x$w_buff0_used~0_In138771615} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out138771615|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out138771615, ~x$w_buff0_used~0=~x$w_buff0_used~0_In138771615} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 05:24:55,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2045732505 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-2045732505 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-2045732505 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-2045732505 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out-2045732505| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In-2045732505 |P1Thread1of1ForFork1_#t~ite54_Out-2045732505|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2045732505, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2045732505, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2045732505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2045732505} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2045732505, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2045732505, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-2045732505|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2045732505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2045732505} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 05:24:55,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_33 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 05:24:55,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_102 256)) (= (mod v_~x$r_buff0_thd0~0_15 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:24:55,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In511717216 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In511717216 256)))) (or (and (= ~x$w_buff1~0_In511717216 |ULTIMATE.start_main_#t~ite57_Out511717216|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite57_Out511717216| ~x~0_In511717216)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In511717216, ~x$w_buff1_used~0=~x$w_buff1_used~0_In511717216, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In511717216, ~x~0=~x~0_In511717216} OutVars{~x$w_buff1~0=~x$w_buff1~0_In511717216, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out511717216|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In511717216, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In511717216, ~x~0=~x~0_In511717216} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 05:24:55,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_23 |v_ULTIMATE.start_main_#t~ite57_8|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-27 05:24:55,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In912843659 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In912843659 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out912843659|)) (and (= ~x$w_buff0_used~0_In912843659 |ULTIMATE.start_main_#t~ite59_Out912843659|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In912843659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In912843659} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In912843659, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out912843659|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In912843659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 05:24:55,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-923647000 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-923647000 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-923647000 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-923647000 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-923647000|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-923647000 |ULTIMATE.start_main_#t~ite60_Out-923647000|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-923647000, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-923647000, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-923647000, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-923647000} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-923647000, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-923647000|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-923647000, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-923647000, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-923647000} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 05:24:55,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-95926445 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-95926445 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-95926445| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-95926445| ~x$r_buff0_thd0~0_In-95926445) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-95926445, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-95926445} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-95926445, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-95926445|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-95926445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 05:24:55,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-166548014 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-166548014 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-166548014 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-166548014 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-166548014| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite62_Out-166548014| ~x$r_buff1_thd0~0_In-166548014)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-166548014, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166548014, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-166548014, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-166548014} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-166548014|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-166548014, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166548014, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-166548014, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-166548014} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 05:24:55,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite62_11|) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:24:55,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:24:55 BasicIcfg [2019-12-27 05:24:55,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:24:55,308 INFO L168 Benchmark]: Toolchain (without parser) took 39521.35 ms. Allocated memory was 145.2 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.5 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 894.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:55,309 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 05:24:55,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.12 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 156.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:55,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:55,311 INFO L168 Benchmark]: Boogie Preprocessor took 41.80 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:55,312 INFO L168 Benchmark]: RCFGBuilder took 1048.02 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 98.5 MB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:55,313 INFO L168 Benchmark]: TraceAbstraction took 37536.15 ms. Allocated memory was 202.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 97.8 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 832.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:55,322 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.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.12 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 156.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.80 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1048.02 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 98.5 MB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37536.15 ms. Allocated memory was 202.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 97.8 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 832.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 178 ProgramPointsBefore, 107 ProgramPointsAfterwards, 227 TransitionsBefore, 132 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 27 ChoiceCompositions, 8652 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 131854 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t319, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t320, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = 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=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) 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=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) 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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) 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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) 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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x 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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) 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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) 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=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) 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=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x 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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 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=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 37.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3932 SDtfs, 3758 SDslu, 6587 SDs, 0 SdLazy, 3431 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65331occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 49927 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 82611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...