/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:22:11,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:22:11,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:22:11,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:22:11,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:22:11,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:22:11,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:22:11,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:22:11,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:22:11,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:22:11,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:22:11,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:22:11,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:22:11,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:22:11,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:22:11,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:22:11,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:22:11,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:22:11,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:22:11,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:22:11,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:22:11,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:22:11,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:22:11,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:22:11,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:22:11,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:22:11,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:22:11,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:22:11,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:22:11,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:22:11,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:22:11,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:22:11,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:22:11,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:22:11,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:22:11,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:22:11,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:22:11,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:22:11,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:22:11,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:22:11,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:22:11,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:22:11,752 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:22:11,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:22:11,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:22:11,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:22:11,755 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:22:11,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:22:11,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:22:11,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:22:11,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:22:11,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:22:11,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:22:11,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:22:11,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:22:11,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:22:11,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:22:11,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:22:11,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:22:11,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:22:11,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:22:11,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:22:11,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:22:11,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:22:11,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:22:11,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:22:11,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:22:11,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:22:11,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:22:11,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:22:11,760 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:22:11,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:22:12,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:22:12,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:22:12,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:22:12,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:22:12,054 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:22:12,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-26 22:22:12,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac4b5a4d/721234546cef4476b61508a24cf2aeb5/FLAG8f50849da [2019-12-26 22:22:12,658 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:22:12,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-26 22:22:12,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac4b5a4d/721234546cef4476b61508a24cf2aeb5/FLAG8f50849da [2019-12-26 22:22:12,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac4b5a4d/721234546cef4476b61508a24cf2aeb5 [2019-12-26 22:22:12,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:22:12,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:22:12,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:22:12,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:22:12,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:22:12,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:22:12" (1/1) ... [2019-12-26 22:22:12,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf90666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:12, skipping insertion in model container [2019-12-26 22:22:12,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:22:12" (1/1) ... [2019-12-26 22:22:12,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:22:13,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:22:13,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:22:13,624 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:22:13,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:22:13,765 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:22:13,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13 WrapperNode [2019-12-26 22:22:13,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:22:13,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:22:13,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:22:13,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:22:13,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:22:13,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:22:13,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:22:13,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:22:13,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... [2019-12-26 22:22:13,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:22:13,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:22:13,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:22:13,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:22:13,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:22:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:22:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:22:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:22:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:22:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:22:13,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:22:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:22:13,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:22:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:22:13,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:22:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:22:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:22:13,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:22:13,923 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:22:14,648 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:22:14,648 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:22:14,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:22:14 BoogieIcfgContainer [2019-12-26 22:22:14,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:22:14,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:22:14,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:22:14,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:22:14,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:22:12" (1/3) ... [2019-12-26 22:22:14,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d82426b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:22:14, skipping insertion in model container [2019-12-26 22:22:14,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:22:13" (2/3) ... [2019-12-26 22:22:14,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d82426b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:22:14, skipping insertion in model container [2019-12-26 22:22:14,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:22:14" (3/3) ... [2019-12-26 22:22:14,658 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2019-12-26 22:22:14,666 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:22:14,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:22:14,675 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:22:14,677 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:22:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,770 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,770 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,779 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:22:14,812 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:22:14,828 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:22:14,828 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:22:14,828 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:22:14,828 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:22:14,828 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:22:14,828 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:22:14,828 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:22:14,828 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:22:14,844 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-26 22:22:14,846 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-26 22:22:14,950 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-26 22:22:14,950 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:22:14,965 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:22:14,988 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-26 22:22:15,067 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-26 22:22:15,067 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:22:15,075 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:22:15,094 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 22:22:15,095 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:22:20,508 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 22:22:20,639 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 22:22:20,752 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66821 [2019-12-26 22:22:20,752 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 22:22:20,756 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-26 22:22:32,230 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-26 22:22:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-26 22:22:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 22:22:32,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:32,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 22:22:32,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash 802094366, now seen corresponding path program 1 times [2019-12-26 22:22:32,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:32,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443704824] [2019-12-26 22:22:32,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:32,497 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-26 22:22:32,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443704824] [2019-12-26 22:22:32,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:32,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:22:32,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650467408] [2019-12-26 22:22:32,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:32,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:32,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:32,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:32,523 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-26 22:22:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:33,808 INFO L93 Difference]: Finished difference Result 87938 states and 378592 transitions. [2019-12-26 22:22:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:33,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 22:22:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:36,920 INFO L225 Difference]: With dead ends: 87938 [2019-12-26 22:22:36,920 INFO L226 Difference]: Without dead ends: 82842 [2019-12-26 22:22:36,922 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-26 22:22:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82842 states. [2019-12-26 22:22:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82842 to 82842. [2019-12-26 22:22:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82842 states. [2019-12-26 22:22:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82842 states to 82842 states and 356178 transitions. [2019-12-26 22:22:44,148 INFO L78 Accepts]: Start accepts. Automaton has 82842 states and 356178 transitions. Word has length 5 [2019-12-26 22:22:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:44,148 INFO L462 AbstractCegarLoop]: Abstraction has 82842 states and 356178 transitions. [2019-12-26 22:22:44,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 82842 states and 356178 transitions. [2019-12-26 22:22:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:22:44,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:44,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:44,162 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash -136321435, now seen corresponding path program 1 times [2019-12-26 22:22:44,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:44,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813689094] [2019-12-26 22:22:44,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:44,295 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-26 22:22:44,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813689094] [2019-12-26 22:22:44,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:44,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:44,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999400591] [2019-12-26 22:22:44,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:44,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:44,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:44,299 INFO L87 Difference]: Start difference. First operand 82842 states and 356178 transitions. Second operand 3 states. [2019-12-26 22:22:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:44,540 INFO L93 Difference]: Finished difference Result 21610 states and 74688 transitions. [2019-12-26 22:22:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:44,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:22:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:44,623 INFO L225 Difference]: With dead ends: 21610 [2019-12-26 22:22:44,623 INFO L226 Difference]: Without dead ends: 21610 [2019-12-26 22:22:44,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21610 states. [2019-12-26 22:22:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21610 to 21610. [2019-12-26 22:22:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21610 states. [2019-12-26 22:22:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21610 states to 21610 states and 74688 transitions. [2019-12-26 22:22:48,061 INFO L78 Accepts]: Start accepts. Automaton has 21610 states and 74688 transitions. Word has length 13 [2019-12-26 22:22:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:48,061 INFO L462 AbstractCegarLoop]: Abstraction has 21610 states and 74688 transitions. [2019-12-26 22:22:48,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21610 states and 74688 transitions. [2019-12-26 22:22:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:22:48,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:48,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:48,064 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:48,064 INFO L82 PathProgramCache]: Analyzing trace with hash -120546049, now seen corresponding path program 1 times [2019-12-26 22:22:48,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:48,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518815544] [2019-12-26 22:22:48,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:48,155 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-26 22:22:48,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518815544] [2019-12-26 22:22:48,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:48,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:48,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716648445] [2019-12-26 22:22:48,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:22:48,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:22:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:22:48,159 INFO L87 Difference]: Start difference. First operand 21610 states and 74688 transitions. Second operand 4 states. [2019-12-26 22:22:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:48,556 INFO L93 Difference]: Finished difference Result 31986 states and 107232 transitions. [2019-12-26 22:22:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:22:48,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:22:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:48,673 INFO L225 Difference]: With dead ends: 31986 [2019-12-26 22:22:48,673 INFO L226 Difference]: Without dead ends: 31972 [2019-12-26 22:22:48,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31972 states. [2019-12-26 22:22:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31972 to 28300. [2019-12-26 22:22:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28300 states. [2019-12-26 22:22:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28300 states to 28300 states and 95848 transitions. [2019-12-26 22:22:49,822 INFO L78 Accepts]: Start accepts. Automaton has 28300 states and 95848 transitions. Word has length 13 [2019-12-26 22:22:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:49,823 INFO L462 AbstractCegarLoop]: Abstraction has 28300 states and 95848 transitions. [2019-12-26 22:22:49,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:22:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 28300 states and 95848 transitions. [2019-12-26 22:22:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:22:49,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:49,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:49,826 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:49,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:49,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2051868705, now seen corresponding path program 1 times [2019-12-26 22:22:49,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:49,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820765033] [2019-12-26 22:22:49,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:49,951 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-26 22:22:49,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820765033] [2019-12-26 22:22:49,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:49,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:22:49,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526194885] [2019-12-26 22:22:49,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:22:49,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:49,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:22:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:49,955 INFO L87 Difference]: Start difference. First operand 28300 states and 95848 transitions. Second operand 5 states. [2019-12-26 22:22:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:50,454 INFO L93 Difference]: Finished difference Result 42745 states and 142288 transitions. [2019-12-26 22:22:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:22:50,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 22:22:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:50,541 INFO L225 Difference]: With dead ends: 42745 [2019-12-26 22:22:50,541 INFO L226 Difference]: Without dead ends: 42727 [2019-12-26 22:22:50,541 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-26 22:22:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42727 states. [2019-12-26 22:22:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42727 to 34163. [2019-12-26 22:22:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34163 states. [2019-12-26 22:22:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34163 states to 34163 states and 114786 transitions. [2019-12-26 22:22:51,730 INFO L78 Accepts]: Start accepts. Automaton has 34163 states and 114786 transitions. Word has length 14 [2019-12-26 22:22:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:51,731 INFO L462 AbstractCegarLoop]: Abstraction has 34163 states and 114786 transitions. [2019-12-26 22:22:51,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:22:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34163 states and 114786 transitions. [2019-12-26 22:22:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:22:51,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:51,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:51,743 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1808091808, now seen corresponding path program 1 times [2019-12-26 22:22:51,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:51,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288190461] [2019-12-26 22:22:51,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:51,895 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-26 22:22:51,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288190461] [2019-12-26 22:22:51,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:51,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:22:51,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134023703] [2019-12-26 22:22:51,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:22:51,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:51,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:22:51,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:22:51,897 INFO L87 Difference]: Start difference. First operand 34163 states and 114786 transitions. Second operand 6 states. [2019-12-26 22:22:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:52,856 INFO L93 Difference]: Finished difference Result 52347 states and 172257 transitions. [2019-12-26 22:22:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:22:52,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:22:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:52,946 INFO L225 Difference]: With dead ends: 52347 [2019-12-26 22:22:52,947 INFO L226 Difference]: Without dead ends: 52317 [2019-12-26 22:22:52,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:22:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52317 states. [2019-12-26 22:22:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52317 to 34394. [2019-12-26 22:22:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34394 states. [2019-12-26 22:22:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34394 states to 34394 states and 114647 transitions. [2019-12-26 22:22:53,966 INFO L78 Accepts]: Start accepts. Automaton has 34394 states and 114647 transitions. Word has length 22 [2019-12-26 22:22:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:53,967 INFO L462 AbstractCegarLoop]: Abstraction has 34394 states and 114647 transitions. [2019-12-26 22:22:53,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:22:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34394 states and 114647 transitions. [2019-12-26 22:22:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:22:53,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:53,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:22:53,982 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:53,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1844565345, now seen corresponding path program 1 times [2019-12-26 22:22:53,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:53,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581392665] [2019-12-26 22:22:53,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:22:54,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581392665] [2019-12-26 22:22:54,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:54,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:22:54,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620961503] [2019-12-26 22:22:54,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:22:54,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:22:54,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:22:54,039 INFO L87 Difference]: Start difference. First operand 34394 states and 114647 transitions. Second operand 4 states. [2019-12-26 22:22:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:54,097 INFO L93 Difference]: Finished difference Result 13523 states and 41801 transitions. [2019-12-26 22:22:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:22:54,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:22:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:54,116 INFO L225 Difference]: With dead ends: 13523 [2019-12-26 22:22:54,117 INFO L226 Difference]: Without dead ends: 13523 [2019-12-26 22:22:54,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:22:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2019-12-26 22:22:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 13303. [2019-12-26 22:22:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13303 states. [2019-12-26 22:22:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 41151 transitions. [2019-12-26 22:22:54,313 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 41151 transitions. Word has length 25 [2019-12-26 22:22:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:54,313 INFO L462 AbstractCegarLoop]: Abstraction has 13303 states and 41151 transitions. [2019-12-26 22:22:54,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:22:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 41151 transitions. [2019-12-26 22:22:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:22:54,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:54,333 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] [2019-12-26 22:22:54,333 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:54,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:54,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1639479592, now seen corresponding path program 1 times [2019-12-26 22:22:54,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:54,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744639408] [2019-12-26 22:22:54,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:54,430 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-26 22:22:54,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744639408] [2019-12-26 22:22:54,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:54,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:22:54,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21520497] [2019-12-26 22:22:54,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:54,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:54,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:54,432 INFO L87 Difference]: Start difference. First operand 13303 states and 41151 transitions. Second operand 3 states. [2019-12-26 22:22:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:54,490 INFO L93 Difference]: Finished difference Result 12716 states and 38855 transitions. [2019-12-26 22:22:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:54,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:22:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:54,601 INFO L225 Difference]: With dead ends: 12716 [2019-12-26 22:22:54,602 INFO L226 Difference]: Without dead ends: 12716 [2019-12-26 22:22:54,602 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-26 22:22:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2019-12-26 22:22:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 12700. [2019-12-26 22:22:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12700 states. [2019-12-26 22:22:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 38815 transitions. [2019-12-26 22:22:54,781 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 38815 transitions. Word has length 39 [2019-12-26 22:22:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:54,782 INFO L462 AbstractCegarLoop]: Abstraction has 12700 states and 38815 transitions. [2019-12-26 22:22:54,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 38815 transitions. [2019-12-26 22:22:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:22:54,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:54,801 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] [2019-12-26 22:22:54,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:54,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1144095462, now seen corresponding path program 1 times [2019-12-26 22:22:54,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:54,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347346367] [2019-12-26 22:22:54,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:54,896 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-26 22:22:54,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347346367] [2019-12-26 22:22:54,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:54,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:22:54,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070495870] [2019-12-26 22:22:54,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:22:54,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:22:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:54,898 INFO L87 Difference]: Start difference. First operand 12700 states and 38815 transitions. Second operand 5 states. [2019-12-26 22:22:55,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:55,434 INFO L93 Difference]: Finished difference Result 17919 states and 54342 transitions. [2019-12-26 22:22:55,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:22:55,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:22:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:55,470 INFO L225 Difference]: With dead ends: 17919 [2019-12-26 22:22:55,470 INFO L226 Difference]: Without dead ends: 17919 [2019-12-26 22:22:55,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:22:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17919 states. [2019-12-26 22:22:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17919 to 16320. [2019-12-26 22:22:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16320 states. [2019-12-26 22:22:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 49873 transitions. [2019-12-26 22:22:55,794 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 49873 transitions. Word has length 40 [2019-12-26 22:22:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:55,794 INFO L462 AbstractCegarLoop]: Abstraction has 16320 states and 49873 transitions. [2019-12-26 22:22:55,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:22:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 49873 transitions. [2019-12-26 22:22:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:22:55,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:55,819 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] [2019-12-26 22:22:55,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2007286560, now seen corresponding path program 2 times [2019-12-26 22:22:55,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:55,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987468343] [2019-12-26 22:22:55,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:55,887 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-26 22:22:55,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987468343] [2019-12-26 22:22:55,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:55,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:22:55,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665618053] [2019-12-26 22:22:55,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:22:55,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:55,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:22:55,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:55,889 INFO L87 Difference]: Start difference. First operand 16320 states and 49873 transitions. Second operand 5 states. [2019-12-26 22:22:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:55,976 INFO L93 Difference]: Finished difference Result 14953 states and 46364 transitions. [2019-12-26 22:22:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:22:55,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:22:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:56,004 INFO L225 Difference]: With dead ends: 14953 [2019-12-26 22:22:56,005 INFO L226 Difference]: Without dead ends: 14953 [2019-12-26 22:22:56,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:22:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14953 states. [2019-12-26 22:22:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14953 to 13921. [2019-12-26 22:22:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13921 states. [2019-12-26 22:22:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13921 states to 13921 states and 43359 transitions. [2019-12-26 22:22:56,355 INFO L78 Accepts]: Start accepts. Automaton has 13921 states and 43359 transitions. Word has length 40 [2019-12-26 22:22:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:56,355 INFO L462 AbstractCegarLoop]: Abstraction has 13921 states and 43359 transitions. [2019-12-26 22:22:56,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:22:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13921 states and 43359 transitions. [2019-12-26 22:22:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:22:56,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:56,387 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] [2019-12-26 22:22:56,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 425228576, now seen corresponding path program 1 times [2019-12-26 22:22:56,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:56,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86378549] [2019-12-26 22:22:56,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:56,678 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-26 22:22:56,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86378549] [2019-12-26 22:22:56,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:56,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:22:56,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845045018] [2019-12-26 22:22:56,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:22:56,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:22:56,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:22:56,680 INFO L87 Difference]: Start difference. First operand 13921 states and 43359 transitions. Second operand 9 states. [2019-12-26 22:22:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:58,120 INFO L93 Difference]: Finished difference Result 31249 states and 96830 transitions. [2019-12-26 22:22:58,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:22:58,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 22:22:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:58,153 INFO L225 Difference]: With dead ends: 31249 [2019-12-26 22:22:58,153 INFO L226 Difference]: Without dead ends: 22250 [2019-12-26 22:22:58,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:22:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22250 states. [2019-12-26 22:22:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22250 to 17210. [2019-12-26 22:22:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17210 states. [2019-12-26 22:22:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17210 states to 17210 states and 53206 transitions. [2019-12-26 22:22:58,443 INFO L78 Accepts]: Start accepts. Automaton has 17210 states and 53206 transitions. Word has length 55 [2019-12-26 22:22:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:58,443 INFO L462 AbstractCegarLoop]: Abstraction has 17210 states and 53206 transitions. [2019-12-26 22:22:58,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:22:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 17210 states and 53206 transitions. [2019-12-26 22:22:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:22:58,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:58,463 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] [2019-12-26 22:22:58,463 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:58,464 INFO L82 PathProgramCache]: Analyzing trace with hash 235395682, now seen corresponding path program 2 times [2019-12-26 22:22:58,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:58,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78433750] [2019-12-26 22:22:58,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:58,522 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-26 22:22:58,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78433750] [2019-12-26 22:22:58,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:58,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:22:58,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297741301] [2019-12-26 22:22:58,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:22:58,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:22:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:22:58,524 INFO L87 Difference]: Start difference. First operand 17210 states and 53206 transitions. Second operand 3 states. [2019-12-26 22:22:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:22:58,637 INFO L93 Difference]: Finished difference Result 23156 states and 70253 transitions. [2019-12-26 22:22:58,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:22:58,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:22:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:22:58,680 INFO L225 Difference]: With dead ends: 23156 [2019-12-26 22:22:58,680 INFO L226 Difference]: Without dead ends: 23156 [2019-12-26 22:22:58,681 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-26 22:22:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23156 states. [2019-12-26 22:22:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23156 to 19339. [2019-12-26 22:22:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19339 states. [2019-12-26 22:22:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19339 states to 19339 states and 59397 transitions. [2019-12-26 22:22:59,242 INFO L78 Accepts]: Start accepts. Automaton has 19339 states and 59397 transitions. Word has length 55 [2019-12-26 22:22:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:22:59,243 INFO L462 AbstractCegarLoop]: Abstraction has 19339 states and 59397 transitions. [2019-12-26 22:22:59,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:22:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 19339 states and 59397 transitions. [2019-12-26 22:22:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:22:59,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:22:59,264 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] [2019-12-26 22:22:59,264 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:22:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:22:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash 579382589, now seen corresponding path program 1 times [2019-12-26 22:22:59,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:22:59,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449036397] [2019-12-26 22:22:59,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:22:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:22:59,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-26 22:22:59,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449036397] [2019-12-26 22:22:59,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:22:59,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:22:59,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537622844] [2019-12-26 22:22:59,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:22:59,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:22:59,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:22:59,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:22:59,435 INFO L87 Difference]: Start difference. First operand 19339 states and 59397 transitions. Second operand 10 states. [2019-12-26 22:23:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:02,218 INFO L93 Difference]: Finished difference Result 35706 states and 106178 transitions. [2019-12-26 22:23:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 22:23:02,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-26 22:23:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:02,269 INFO L225 Difference]: With dead ends: 35706 [2019-12-26 22:23:02,269 INFO L226 Difference]: Without dead ends: 35502 [2019-12-26 22:23:02,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 22:23:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35502 states. [2019-12-26 22:23:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35502 to 20462. [2019-12-26 22:23:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20462 states. [2019-12-26 22:23:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 62626 transitions. [2019-12-26 22:23:02,689 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 62626 transitions. Word has length 55 [2019-12-26 22:23:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:02,690 INFO L462 AbstractCegarLoop]: Abstraction has 20462 states and 62626 transitions. [2019-12-26 22:23:02,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:23:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 62626 transitions. [2019-12-26 22:23:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:23:02,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:02,720 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] [2019-12-26 22:23:02,720 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:02,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1244789413, now seen corresponding path program 2 times [2019-12-26 22:23:02,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:02,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293576132] [2019-12-26 22:23:02,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:03,192 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-26 22:23:03,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293576132] [2019-12-26 22:23:03,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:03,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:23:03,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250924194] [2019-12-26 22:23:03,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:23:03,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:23:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:23:03,194 INFO L87 Difference]: Start difference. First operand 20462 states and 62626 transitions. Second operand 11 states. [2019-12-26 22:23:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:04,744 INFO L93 Difference]: Finished difference Result 45348 states and 137719 transitions. [2019-12-26 22:23:04,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 22:23:04,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-26 22:23:04,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:04,789 INFO L225 Difference]: With dead ends: 45348 [2019-12-26 22:23:04,789 INFO L226 Difference]: Without dead ends: 30885 [2019-12-26 22:23:04,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 22:23:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30885 states. [2019-12-26 22:23:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30885 to 19136. [2019-12-26 22:23:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19136 states. [2019-12-26 22:23:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19136 states to 19136 states and 58302 transitions. [2019-12-26 22:23:05,149 INFO L78 Accepts]: Start accepts. Automaton has 19136 states and 58302 transitions. Word has length 55 [2019-12-26 22:23:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:05,149 INFO L462 AbstractCegarLoop]: Abstraction has 19136 states and 58302 transitions. [2019-12-26 22:23:05,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:23:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 19136 states and 58302 transitions. [2019-12-26 22:23:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:23:05,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:05,177 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] [2019-12-26 22:23:05,177 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -911900375, now seen corresponding path program 3 times [2019-12-26 22:23:05,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:05,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023351589] [2019-12-26 22:23:05,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:05,269 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-26 22:23:05,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023351589] [2019-12-26 22:23:05,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:05,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:23:05,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833802083] [2019-12-26 22:23:05,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:23:05,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:05,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:23:05,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:23:05,271 INFO L87 Difference]: Start difference. First operand 19136 states and 58302 transitions. Second operand 7 states. [2019-12-26 22:23:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:06,051 INFO L93 Difference]: Finished difference Result 27979 states and 83505 transitions. [2019-12-26 22:23:06,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:23:06,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 22:23:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:06,092 INFO L225 Difference]: With dead ends: 27979 [2019-12-26 22:23:06,092 INFO L226 Difference]: Without dead ends: 27979 [2019-12-26 22:23:06,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:23:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27979 states. [2019-12-26 22:23:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27979 to 19289. [2019-12-26 22:23:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19289 states. [2019-12-26 22:23:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19289 states to 19289 states and 58860 transitions. [2019-12-26 22:23:06,553 INFO L78 Accepts]: Start accepts. Automaton has 19289 states and 58860 transitions. Word has length 55 [2019-12-26 22:23:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:06,553 INFO L462 AbstractCegarLoop]: Abstraction has 19289 states and 58860 transitions. [2019-12-26 22:23:06,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:23:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 19289 states and 58860 transitions. [2019-12-26 22:23:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:23:06,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:06,574 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] [2019-12-26 22:23:06,574 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash 128075039, now seen corresponding path program 4 times [2019-12-26 22:23:06,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:06,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009829293] [2019-12-26 22:23:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:06,638 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-26 22:23:06,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009829293] [2019-12-26 22:23:06,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:06,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:23:06,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210091509] [2019-12-26 22:23:06,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:23:06,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:23:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:23:06,641 INFO L87 Difference]: Start difference. First operand 19289 states and 58860 transitions. Second operand 3 states. [2019-12-26 22:23:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:06,725 INFO L93 Difference]: Finished difference Result 19287 states and 58855 transitions. [2019-12-26 22:23:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:23:06,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:23:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:06,761 INFO L225 Difference]: With dead ends: 19287 [2019-12-26 22:23:06,761 INFO L226 Difference]: Without dead ends: 19287 [2019-12-26 22:23:06,762 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-26 22:23:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-26 22:23:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 14813. [2019-12-26 22:23:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14813 states. [2019-12-26 22:23:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14813 states to 14813 states and 46146 transitions. [2019-12-26 22:23:07,070 INFO L78 Accepts]: Start accepts. Automaton has 14813 states and 46146 transitions. Word has length 55 [2019-12-26 22:23:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:07,071 INFO L462 AbstractCegarLoop]: Abstraction has 14813 states and 46146 transitions. [2019-12-26 22:23:07,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:23:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14813 states and 46146 transitions. [2019-12-26 22:23:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:23:07,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:07,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 22:23:07,087 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash -198986136, now seen corresponding path program 1 times [2019-12-26 22:23:07,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:07,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175031352] [2019-12-26 22:23:07,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:07,297 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-26 22:23:07,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175031352] [2019-12-26 22:23:07,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:07,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:23:07,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891238167] [2019-12-26 22:23:07,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:23:07,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:23:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:23:07,302 INFO L87 Difference]: Start difference. First operand 14813 states and 46146 transitions. Second operand 11 states. [2019-12-26 22:23:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:08,845 INFO L93 Difference]: Finished difference Result 18254 states and 56327 transitions. [2019-12-26 22:23:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:23:08,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 22:23:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:08,874 INFO L225 Difference]: With dead ends: 18254 [2019-12-26 22:23:08,875 INFO L226 Difference]: Without dead ends: 17952 [2019-12-26 22:23:08,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:23:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2019-12-26 22:23:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 14697. [2019-12-26 22:23:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14697 states. [2019-12-26 22:23:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14697 states to 14697 states and 45864 transitions. [2019-12-26 22:23:09,251 INFO L78 Accepts]: Start accepts. Automaton has 14697 states and 45864 transitions. Word has length 56 [2019-12-26 22:23:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:09,251 INFO L462 AbstractCegarLoop]: Abstraction has 14697 states and 45864 transitions. [2019-12-26 22:23:09,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:23:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 14697 states and 45864 transitions. [2019-12-26 22:23:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:23:09,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:09,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:09,270 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:23:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash -196673722, now seen corresponding path program 2 times [2019-12-26 22:23:09,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:09,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373892019] [2019-12-26 22:23:09,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:23:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:23:09,422 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:23:09,423 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:23:09,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= v_~z~0_13 0) (= v_~__unbuffered_cnt~0_148 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff0_thd1~0_322 0) (= 0 v_~x$r_buff0_thd2~0_247) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21| 1)) (= v_~x$flush_delayed~0_68 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t916~0.base_21| 4)) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21|) |v_ULTIMATE.start_main_~#t916~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t916~0.base_21|) (= v_~x$r_buff1_thd1~0_293 0) (= v_~x$r_buff0_thd0~0_140 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21|) 0) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$w_buff0~0_441) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~x~0_192) (= v_~main$tmp_guard0~0_20 0) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= 0 |v_ULTIMATE.start_main_~#t916~0.offset_16|) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX~0_150 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_964) (= v_~x$r_buff1_thd0~0_215 0) (= v_~x$mem_tmp~0_38 0) (= v_~a~0_41 0) (= 0 v_~x$r_buff0_thd3~0_132))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_441, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_293, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_270|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~a~0=v_~a~0_41, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t916~0.offset=|v_ULTIMATE.start_main_~#t916~0.offset_16|, ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_35, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~x~0=v_~x~0_192, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_72|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y~0=v_~y~0_44, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_964, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_155, ULTIMATE.start_main_~#t916~0.base=|v_ULTIMATE.start_main_~#t916~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t916~0.offset, ULTIMATE.start_main_~#t917~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t918~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t917~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t916~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 22:23:09,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= |v_ULTIMATE.start_main_~#t917~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13|) |v_ULTIMATE.start_main_~#t917~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t917~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t917~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t917~0.offset, ULTIMATE.start_main_~#t917~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 22:23:09,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t918~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t918~0.base_13|) (= |v_ULTIMATE.start_main_~#t918~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t918~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13|) |v_ULTIMATE.start_main_~#t918~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_13|, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_~#t918~0.offset] because there is no mapped edge [2019-12-26 22:23:09,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0~0_19) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= v_~x$w_buff1_used~0_44 v_~x$w_buff0_used~0_74) (= 1 v_~x$w_buff0_used~0_73) (= 0 (mod v_~x$w_buff1_used~0_44 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} 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-26 22:23:09,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-471068704 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-471068704 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-471068704 |P2Thread1of1ForFork2_#t~ite32_Out-471068704|)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out-471068704| ~x$w_buff1~0_In-471068704) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-471068704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-471068704, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-471068704, ~x~0=~x~0_In-471068704} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-471068704|, ~x$w_buff1~0=~x$w_buff1~0_In-471068704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-471068704, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-471068704, ~x~0=~x~0_In-471068704} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-26 22:23:09,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1935910674 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1935910674 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1935910674|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1935910674 |P1Thread1of1ForFork1_#t~ite28_Out-1935910674|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1935910674, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935910674} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1935910674, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1935910674|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935910674} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 22:23:09,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= v_~x~0_35 |v_P2Thread1of1ForFork2_#t~ite32_12|) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_12|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_17|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-26 22:23:09,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-230581591 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-230581591 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-230581591| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-230581591 |P2Thread1of1ForFork2_#t~ite34_Out-230581591|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-230581591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-230581591} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-230581591|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-230581591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-230581591} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-26 22:23:09,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In2107289830 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In2107289830 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2107289830 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2107289830 256)))) (or (and (= ~x$w_buff1_used~0_In2107289830 |P2Thread1of1ForFork2_#t~ite35_Out2107289830|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out2107289830|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2107289830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2107289830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2107289830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2107289830} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out2107289830|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2107289830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2107289830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2107289830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2107289830} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-26 22:23:09,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1449320733 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1449320733 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1449320733 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1449320733 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1449320733| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite29_Out-1449320733| ~x$w_buff1_used~0_In-1449320733)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1449320733, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1449320733, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1449320733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1449320733} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1449320733|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1449320733, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1449320733, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1449320733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1449320733} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-26 22:23:09,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1227558707 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1227558707 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1227558707) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-1227558707 ~x$r_buff0_thd2~0_Out-1227558707) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1227558707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227558707} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1227558707|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1227558707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227558707} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 22:23:09,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In1507437113 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1507437113 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1507437113 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1507437113 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In1507437113 |P1Thread1of1ForFork1_#t~ite31_Out1507437113|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out1507437113|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1507437113, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1507437113, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1507437113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1507437113} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1507437113|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1507437113, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1507437113, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1507437113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1507437113} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 22:23:09,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_113 |v_P1Thread1of1ForFork1_#t~ite31_42|)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_41|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:23:09,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-181351573 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-181351573| ~x$w_buff1~0_In-181351573) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In-181351573| |P0Thread1of1ForFork0_#t~ite11_Out-181351573|)) (and (= ~x$w_buff1~0_In-181351573 |P0Thread1of1ForFork0_#t~ite11_Out-181351573|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-181351573 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-181351573 256))) (= (mod ~x$w_buff0_used~0_In-181351573 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-181351573 256))))) .cse0 (= |P0Thread1of1ForFork0_#t~ite12_Out-181351573| |P0Thread1of1ForFork0_#t~ite11_Out-181351573|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-181351573|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-181351573, ~x$w_buff1~0=~x$w_buff1~0_In-181351573, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-181351573, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-181351573, ~weak$$choice2~0=~weak$$choice2~0_In-181351573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-181351573} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-181351573|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-181351573, ~x$w_buff1~0=~x$w_buff1~0_In-181351573, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-181351573, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-181351573, ~weak$$choice2~0=~weak$$choice2~0_In-181351573, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-181351573|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-181351573} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 22:23:09,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2037152886 256) 0))) (or (and .cse0 (= ~x$w_buff0_used~0_In-2037152886 |P0Thread1of1ForFork0_#t~ite14_Out-2037152886|) (= |P0Thread1of1ForFork0_#t~ite15_Out-2037152886| |P0Thread1of1ForFork0_#t~ite14_Out-2037152886|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2037152886 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-2037152886 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-2037152886 256) 0)) (= (mod ~x$w_buff0_used~0_In-2037152886 256) 0)))) (and (= ~x$w_buff0_used~0_In-2037152886 |P0Thread1of1ForFork0_#t~ite15_Out-2037152886|) (= |P0Thread1of1ForFork0_#t~ite14_In-2037152886| |P0Thread1of1ForFork0_#t~ite14_Out-2037152886|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2037152886, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2037152886, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2037152886, ~weak$$choice2~0=~weak$$choice2~0_In-2037152886, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-2037152886|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2037152886} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2037152886, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2037152886, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2037152886, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-2037152886|, ~weak$$choice2~0=~weak$$choice2~0_In-2037152886, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-2037152886|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2037152886} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 22:23:09,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_65 v_~x$r_buff0_thd1~0_64) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_64, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-26 22:23:09,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= v_~x$flush_delayed~0_20 0) (= v_~x~0_54 v_~x$mem_tmp~0_15) (not (= (mod v_~x$flush_delayed~0_21 256) 0)) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 22:23:09,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In465262929 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In465262929 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite36_Out465262929| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite36_Out465262929| ~x$r_buff0_thd3~0_In465262929) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In465262929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465262929} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out465262929|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In465262929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465262929} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-26 22:23:09,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1058980819 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1058980819 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1058980819 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1058980819 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-1058980819|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In-1058980819 |P2Thread1of1ForFork2_#t~ite37_Out-1058980819|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1058980819, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1058980819, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1058980819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1058980819} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1058980819|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1058980819, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1058980819, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1058980819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1058980819} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-26 22:23:09,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_46| v_~x$r_buff1_thd3~0_117)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_45|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:23:09,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:23:09,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1972818599 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1972818599 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1972818599 |ULTIMATE.start_main_#t~ite41_Out1972818599|) (not .cse1)) (and (= ~x~0_In1972818599 |ULTIMATE.start_main_#t~ite41_Out1972818599|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1972818599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1972818599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1972818599, ~x~0=~x~0_In1972818599} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1972818599|, ~x$w_buff1~0=~x$w_buff1~0_In1972818599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1972818599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1972818599, ~x~0=~x~0_In1972818599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 22:23:09,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 22:23:09,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In389693137 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In389693137 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out389693137| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out389693137| ~x$w_buff0_used~0_In389693137)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In389693137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In389693137} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In389693137, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out389693137|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In389693137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:23:09,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-880703849 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-880703849 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-880703849 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-880703849 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-880703849|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-880703849 |ULTIMATE.start_main_#t~ite44_Out-880703849|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-880703849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-880703849, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-880703849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-880703849} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-880703849, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-880703849, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-880703849, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-880703849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-880703849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:23:09,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In797740701 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In797740701 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out797740701| 0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In797740701 |ULTIMATE.start_main_#t~ite45_Out797740701|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In797740701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In797740701} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In797740701, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out797740701|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In797740701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:23:09,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-903604377 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-903604377 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-903604377 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-903604377 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-903604377| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-903604377 |ULTIMATE.start_main_#t~ite46_Out-903604377|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-903604377, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-903604377, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-903604377, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-903604377} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-903604377, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-903604377|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-903604377, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-903604377, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-903604377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 22:23:09,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p1_EAX~0_139 0) (= v_~x$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite46_54|) (= v_~main$tmp_guard1~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:23:09,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:23:09 BasicIcfg [2019-12-26 22:23:09,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:23:09,566 INFO L168 Benchmark]: Toolchain (without parser) took 56612.78 ms. Allocated memory was 146.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 803.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:09,566 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:23:09,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.36 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 103.0 MB in the beginning and 157.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:09,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.43 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:09,568 INFO L168 Benchmark]: Boogie Preprocessor took 37.40 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:09,569 INFO L168 Benchmark]: RCFGBuilder took 789.06 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 105.8 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:09,570 INFO L168 Benchmark]: TraceAbstraction took 54912.21 ms. Allocated memory was 203.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 105.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 748.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:23:09,573 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.37 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.36 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 103.0 MB in the beginning and 157.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.43 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.40 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.06 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 105.8 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54912.21 ms. Allocated memory was 203.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 105.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 748.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6463 VarBasedMoverChecksPositive, 266 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66821 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L830] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L832] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L779] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L779] 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) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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 [L743] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L743] 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) [L744] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L744] 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)) [L745] 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)) [L746] 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)) [L747] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L747] 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)) [L749] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L749] 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)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 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 [L841] 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 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 54.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3001 SDtfs, 3650 SDslu, 9993 SDs, 0 SdLazy, 7459 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89098occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 85091 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 113645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...