/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:03:57,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:03:57,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:03:57,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:03:57,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:03:57,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:03:57,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:03:57,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:03:57,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:03:57,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:03:57,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:03:57,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:03:57,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:03:57,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:03:57,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:03:57,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:03:57,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:03:57,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:03:57,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:03:57,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:03:57,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:03:57,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:03:57,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:03:57,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:03:57,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:03:57,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:03:57,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:03:57,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:03:57,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:03:57,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:03:57,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:03:57,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:03:57,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:03:57,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:03:57,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:03:57,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:03:57,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:03:57,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:03:57,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:03:57,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:03:57,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:03:57,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:03:57,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:03:57,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:03:57,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:03:57,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:03:57,924 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:03:57,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:03:57,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:03:57,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:03:57,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:03:57,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:03:57,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:03:57,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:03:57,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:03:57,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:03:57,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:03:57,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:03:57,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:03:57,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:03:57,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:03:57,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:03:57,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:03:57,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:03:57,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:03:57,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:03:57,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:03:57,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:03:57,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:03:57,929 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:03:57,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:03:57,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:03:58,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:03:58,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:03:58,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:03:58,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:03:58,252 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:03:58,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i [2019-12-18 22:03:58,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443f13006/d5abcbb5b7c446ad8895aa0e341b4ac3/FLAGabf6f8fa2 [2019-12-18 22:03:58,894 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:03:58,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i [2019-12-18 22:03:58,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443f13006/d5abcbb5b7c446ad8895aa0e341b4ac3/FLAGabf6f8fa2 [2019-12-18 22:03:59,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443f13006/d5abcbb5b7c446ad8895aa0e341b4ac3 [2019-12-18 22:03:59,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:03:59,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:03:59,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:59,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:03:59,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:03:59,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:03:59,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c488c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59, skipping insertion in model container [2019-12-18 22:03:59,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:03:59,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:03:59,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:03:59,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:59,773 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:03:59,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:59,923 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:03:59,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59 WrapperNode [2019-12-18 22:03:59,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:59,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:59,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:03:59,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:03:59,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:03:59,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:03:59,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:59,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:03:59,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:03:59,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:04:00,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:04:00,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:04:00,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:04:00,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:04:00,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:04:00,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:04:00,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... [2019-12-18 22:04:00,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:04:00,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:04:00,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:04:00,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:04:00,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:04:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:04:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:04:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:04:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:04:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:04:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:04:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:04:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:04:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:04:00,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:04:00,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:04:00,105 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:04:00,777 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:04:00,778 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:04:00,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:04:00 BoogieIcfgContainer [2019-12-18 22:04:00,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:04:00,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:04:00,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:04:00,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:04:00,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:03:59" (1/3) ... [2019-12-18 22:04:00,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1885ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:04:00, skipping insertion in model container [2019-12-18 22:04:00,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:59" (2/3) ... [2019-12-18 22:04:00,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1885ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:04:00, skipping insertion in model container [2019-12-18 22:04:00,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:04:00" (3/3) ... [2019-12-18 22:04:00,792 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.opt.i [2019-12-18 22:04:00,803 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:04:00,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:04:00,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:04:00,816 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:04:00,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,876 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,877 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,912 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,913 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,913 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:04:00,940 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:04:00,961 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:04:00,961 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:04:00,962 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:04:00,962 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:04:00,962 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:04:00,962 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:04:00,962 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:04:00,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:04:00,979 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 22:04:00,998 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:04:01,068 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:04:01,069 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:04:01,082 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:04:01,099 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:04:01,136 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:04:01,136 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:04:01,142 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:04:01,155 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 22:04:01,156 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:04:04,057 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:04:04,175 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:04:04,226 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-18 22:04:04,227 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 22:04:04,230 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-18 22:04:04,624 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-18 22:04:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-18 22:04:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:04:04,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:04,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:04:04,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-18 22:04:04,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:04,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182882896] [2019-12-18 22:04:04,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:04,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182882896] [2019-12-18 22:04:04,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:04,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:04:04,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686612504] [2019-12-18 22:04:04,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:04,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:04,877 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-18 22:04:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:05,167 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-18 22:04:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:05,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:04:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:05,325 INFO L225 Difference]: With dead ends: 6863 [2019-12-18 22:04:05,325 INFO L226 Difference]: Without dead ends: 6460 [2019-12-18 22:04:05,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-18 22:04:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-18 22:04:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-18 22:04:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-18 22:04:05,690 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-18 22:04:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:05,690 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-18 22:04:05,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-18 22:04:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:04:05,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:05,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:05,695 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-18 22:04:05,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:05,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539880197] [2019-12-18 22:04:05,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:05,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539880197] [2019-12-18 22:04:05,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:05,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:05,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546392637] [2019-12-18 22:04:05,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:05,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:05,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:05,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:05,831 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-18 22:04:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:06,247 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-18 22:04:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:06,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:04:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:06,338 INFO L225 Difference]: With dead ends: 9760 [2019-12-18 22:04:06,339 INFO L226 Difference]: Without dead ends: 9746 [2019-12-18 22:04:06,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-18 22:04:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-18 22:04:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-18 22:04:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-18 22:04:06,811 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-18 22:04:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:06,812 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-18 22:04:06,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-18 22:04:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:04:06,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:06,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:06,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-18 22:04:06,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:06,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703020055] [2019-12-18 22:04:06,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:06,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703020055] [2019-12-18 22:04:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:06,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:06,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589557778] [2019-12-18 22:04:06,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:06,881 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 3 states. [2019-12-18 22:04:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:07,082 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-18 22:04:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:07,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:04:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:07,135 INFO L225 Difference]: With dead ends: 12018 [2019-12-18 22:04:07,136 INFO L226 Difference]: Without dead ends: 12018 [2019-12-18 22:04:07,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-18 22:04:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-18 22:04:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-18 22:04:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-18 22:04:08,151 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-18 22:04:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:08,152 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-18 22:04:08,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-18 22:04:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:04:08,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:08,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:08,157 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-18 22:04:08,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:08,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954926051] [2019-12-18 22:04:08,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:08,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954926051] [2019-12-18 22:04:08,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:08,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:08,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361644995] [2019-12-18 22:04:08,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:08,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:08,219 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 4 states. [2019-12-18 22:04:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:08,536 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-18 22:04:08,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:08,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:04:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:08,585 INFO L225 Difference]: With dead ends: 13296 [2019-12-18 22:04:08,585 INFO L226 Difference]: Without dead ends: 13285 [2019-12-18 22:04:08,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-18 22:04:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-18 22:04:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-18 22:04:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-18 22:04:09,124 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-18 22:04:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:09,125 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-18 22:04:09,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-18 22:04:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:04:09,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:09,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:09,128 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-18 22:04:09,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:09,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528769504] [2019-12-18 22:04:09,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:09,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528769504] [2019-12-18 22:04:09,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:09,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:09,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227492309] [2019-12-18 22:04:09,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:09,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:09,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:09,194 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 4 states. [2019-12-18 22:04:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:09,409 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-18 22:04:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:09,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:04:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:09,459 INFO L225 Difference]: With dead ends: 14351 [2019-12-18 22:04:09,460 INFO L226 Difference]: Without dead ends: 14338 [2019-12-18 22:04:09,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-18 22:04:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-18 22:04:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-18 22:04:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-18 22:04:09,962 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-18 22:04:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:09,962 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-18 22:04:09,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-18 22:04:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:04:09,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:09,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:09,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-18 22:04:09,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:09,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511380901] [2019-12-18 22:04:09,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:10,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511380901] [2019-12-18 22:04:10,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:10,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:04:10,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805524039] [2019-12-18 22:04:10,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:10,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:10,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:10,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:10,015 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-18 22:04:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:10,070 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-18 22:04:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:10,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 22:04:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:10,153 INFO L225 Difference]: With dead ends: 12224 [2019-12-18 22:04:10,154 INFO L226 Difference]: Without dead ends: 12224 [2019-12-18 22:04:10,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-18 22:04:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-18 22:04:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-18 22:04:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-18 22:04:11,266 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-18 22:04:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:11,266 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-18 22:04:11,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-18 22:04:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:04:11,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:11,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:11,277 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-18 22:04:11,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:11,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063895825] [2019-12-18 22:04:11,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:11,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063895825] [2019-12-18 22:04:11,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:11,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:11,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884058709] [2019-12-18 22:04:11,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:11,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:11,385 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 4 states. [2019-12-18 22:04:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:11,425 INFO L93 Difference]: Finished difference Result 2579 states and 6836 transitions. [2019-12-18 22:04:11,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:04:11,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 22:04:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:11,429 INFO L225 Difference]: With dead ends: 2579 [2019-12-18 22:04:11,430 INFO L226 Difference]: Without dead ends: 1835 [2019-12-18 22:04:11,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-12-18 22:04:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2019-12-18 22:04:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2019-12-18 22:04:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 4472 transitions. [2019-12-18 22:04:11,463 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 4472 transitions. Word has length 17 [2019-12-18 22:04:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:11,463 INFO L462 AbstractCegarLoop]: Abstraction has 1835 states and 4472 transitions. [2019-12-18 22:04:11,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 4472 transitions. [2019-12-18 22:04:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:04:11,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:11,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:11,467 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-18 22:04:11,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:11,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160259685] [2019-12-18 22:04:11,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:11,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160259685] [2019-12-18 22:04:11,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:11,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:11,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560912656] [2019-12-18 22:04:11,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:11,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:11,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:11,510 INFO L87 Difference]: Start difference. First operand 1835 states and 4472 transitions. Second operand 3 states. [2019-12-18 22:04:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:11,552 INFO L93 Difference]: Finished difference Result 2395 states and 5562 transitions. [2019-12-18 22:04:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:11,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 22:04:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:11,556 INFO L225 Difference]: With dead ends: 2395 [2019-12-18 22:04:11,556 INFO L226 Difference]: Without dead ends: 2395 [2019-12-18 22:04:11,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-18 22:04:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1775. [2019-12-18 22:04:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-12-18 22:04:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 4059 transitions. [2019-12-18 22:04:11,590 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 4059 transitions. Word has length 26 [2019-12-18 22:04:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:11,591 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 4059 transitions. [2019-12-18 22:04:11,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 4059 transitions. [2019-12-18 22:04:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:04:11,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:11,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:11,597 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-18 22:04:11,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:11,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663862542] [2019-12-18 22:04:11,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:11,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663862542] [2019-12-18 22:04:11,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:11,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:11,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869555028] [2019-12-18 22:04:11,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:11,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:11,685 INFO L87 Difference]: Start difference. First operand 1775 states and 4059 transitions. Second operand 5 states. [2019-12-18 22:04:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:11,905 INFO L93 Difference]: Finished difference Result 2308 states and 5281 transitions. [2019-12-18 22:04:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:04:11,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 22:04:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:11,909 INFO L225 Difference]: With dead ends: 2308 [2019-12-18 22:04:11,909 INFO L226 Difference]: Without dead ends: 2306 [2019-12-18 22:04:11,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:04:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2019-12-18 22:04:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1867. [2019-12-18 22:04:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-18 22:04:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4281 transitions. [2019-12-18 22:04:11,943 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4281 transitions. Word has length 26 [2019-12-18 22:04:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:11,943 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4281 transitions. [2019-12-18 22:04:11,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4281 transitions. [2019-12-18 22:04:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:04:11,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:11,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:11,947 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:11,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:11,947 INFO L82 PathProgramCache]: Analyzing trace with hash -895166994, now seen corresponding path program 1 times [2019-12-18 22:04:11,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:11,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269536147] [2019-12-18 22:04:11,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:12,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269536147] [2019-12-18 22:04:12,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:12,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:04:12,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733194000] [2019-12-18 22:04:12,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:12,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:12,031 INFO L87 Difference]: Start difference. First operand 1867 states and 4281 transitions. Second operand 5 states. [2019-12-18 22:04:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:12,094 INFO L93 Difference]: Finished difference Result 963 states and 2040 transitions. [2019-12-18 22:04:12,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:12,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 22:04:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:12,097 INFO L225 Difference]: With dead ends: 963 [2019-12-18 22:04:12,097 INFO L226 Difference]: Without dead ends: 852 [2019-12-18 22:04:12,097 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-18 22:04:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-12-18 22:04:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 782. [2019-12-18 22:04:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 22:04:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1644 transitions. [2019-12-18 22:04:12,116 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1644 transitions. Word has length 26 [2019-12-18 22:04:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:12,117 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1644 transitions. [2019-12-18 22:04:12,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1644 transitions. [2019-12-18 22:04:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:04:12,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:12,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:12,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash 464634158, now seen corresponding path program 1 times [2019-12-18 22:04:12,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:12,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568867823] [2019-12-18 22:04:12,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:12,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568867823] [2019-12-18 22:04:12,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:12,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:12,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962235327] [2019-12-18 22:04:12,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:12,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:12,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:12,191 INFO L87 Difference]: Start difference. First operand 782 states and 1644 transitions. Second operand 4 states. [2019-12-18 22:04:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:12,213 INFO L93 Difference]: Finished difference Result 1250 states and 2666 transitions. [2019-12-18 22:04:12,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:04:12,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 22:04:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:12,215 INFO L225 Difference]: With dead ends: 1250 [2019-12-18 22:04:12,215 INFO L226 Difference]: Without dead ends: 488 [2019-12-18 22:04:12,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-18 22:04:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-12-18 22:04:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-18 22:04:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1055 transitions. [2019-12-18 22:04:12,227 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1055 transitions. Word has length 41 [2019-12-18 22:04:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:12,228 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 1055 transitions. [2019-12-18 22:04:12,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1055 transitions. [2019-12-18 22:04:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:04:12,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:12,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:12,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:12,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash 602720702, now seen corresponding path program 2 times [2019-12-18 22:04:12,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:12,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491670212] [2019-12-18 22:04:12,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:12,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491670212] [2019-12-18 22:04:12,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:12,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:04:12,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671326979] [2019-12-18 22:04:12,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:04:12,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:12,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:04:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:04:12,320 INFO L87 Difference]: Start difference. First operand 488 states and 1055 transitions. Second operand 7 states. [2019-12-18 22:04:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:12,497 INFO L93 Difference]: Finished difference Result 893 states and 1881 transitions. [2019-12-18 22:04:12,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:04:12,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 22:04:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:12,499 INFO L225 Difference]: With dead ends: 893 [2019-12-18 22:04:12,499 INFO L226 Difference]: Without dead ends: 597 [2019-12-18 22:04:12,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:04:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-12-18 22:04:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 529. [2019-12-18 22:04:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-18 22:04:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1111 transitions. [2019-12-18 22:04:12,507 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1111 transitions. Word has length 41 [2019-12-18 22:04:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:12,507 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1111 transitions. [2019-12-18 22:04:12,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:04:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1111 transitions. [2019-12-18 22:04:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:04:12,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:12,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:12,510 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:12,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash 261585982, now seen corresponding path program 3 times [2019-12-18 22:04:12,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:12,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918072786] [2019-12-18 22:04:12,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:12,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918072786] [2019-12-18 22:04:12,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:12,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:12,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756456767] [2019-12-18 22:04:12,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:12,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:12,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:12,573 INFO L87 Difference]: Start difference. First operand 529 states and 1111 transitions. Second operand 3 states. [2019-12-18 22:04:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:12,584 INFO L93 Difference]: Finished difference Result 527 states and 1106 transitions. [2019-12-18 22:04:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:12,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 22:04:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:12,586 INFO L225 Difference]: With dead ends: 527 [2019-12-18 22:04:12,586 INFO L226 Difference]: Without dead ends: 527 [2019-12-18 22:04:12,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-12-18 22:04:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-12-18 22:04:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-18 22:04:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1106 transitions. [2019-12-18 22:04:12,596 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1106 transitions. Word has length 41 [2019-12-18 22:04:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:12,596 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1106 transitions. [2019-12-18 22:04:12,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1106 transitions. [2019-12-18 22:04:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:04:12,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:12,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:12,598 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 1 times [2019-12-18 22:04:12,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:12,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170800791] [2019-12-18 22:04:12,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:04:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:04:12,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:04:12,745 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:04:12,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1663~0.base_19| 4) |v_#length_13|) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$flush_delayed~0_13) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1663~0.base_19| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1663~0.base_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1663~0.base_19|) 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= 0 |v_ULTIMATE.start_main_~#t1663~0.offset_17|) (= v_~y$r_buff0_thd1~0_65 0) (= 0 v_~y$r_buff1_thd2~0_17) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1663~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1663~0.base_19|) |v_ULTIMATE.start_main_~#t1663~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ULTIMATE.start_main_~#t1664~0.offset=|v_ULTIMATE.start_main_~#t1664~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ULTIMATE.start_main_~#t1663~0.offset=|v_ULTIMATE.start_main_~#t1663~0.offset_17|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1663~0.base=|v_ULTIMATE.start_main_~#t1663~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_~#t1664~0.base=|v_ULTIMATE.start_main_~#t1664~0.base_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1664~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1663~0.offset, ~y~0, ULTIMATE.start_main_~#t1663~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1664~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:04:12,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1664~0.base_9| 4) |v_#length_9|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1664~0.base_9| 1) |v_#valid_19|) (= |v_ULTIMATE.start_main_~#t1664~0.offset_8| 0) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1664~0.base_9|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1664~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1664~0.base_9|) |v_ULTIMATE.start_main_~#t1664~0.offset_8| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1664~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1664~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1664~0.base=|v_ULTIMATE.start_main_~#t1664~0.base_9|, ULTIMATE.start_main_~#t1664~0.offset=|v_ULTIMATE.start_main_~#t1664~0.offset_8|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1664~0.base, ULTIMATE.start_main_~#t1664~0.offset, #length] because there is no mapped edge [2019-12-18 22:04:12,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:04:12,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2123835813 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2123835813 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2123835813| ~y$w_buff0_used~0_In-2123835813) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2123835813|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2123835813, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2123835813} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2123835813, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2123835813, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2123835813|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:04:12,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In674399899 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In674399899 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In674399899 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In674399899 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In674399899 |P1Thread1of1ForFork0_#t~ite29_Out674399899|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out674399899|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In674399899, ~y$w_buff0_used~0=~y$w_buff0_used~0_In674399899, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In674399899, ~y$w_buff1_used~0=~y$w_buff1_used~0_In674399899} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In674399899, ~y$w_buff0_used~0=~y$w_buff0_used~0_In674399899, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In674399899, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out674399899|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In674399899} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:04:12,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-517738130 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-517738130 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-517738130 ~y$r_buff0_thd2~0_In-517738130)) (and (not .cse1) (= ~y$r_buff0_thd2~0_Out-517738130 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-517738130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-517738130} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-517738130, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-517738130|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-517738130} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:04:12,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1066200631 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1066200631 |P0Thread1of1ForFork1_#t~ite18_Out-1066200631|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite17_In-1066200631| |P0Thread1of1ForFork1_#t~ite17_Out-1066200631|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1066200631 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1066200631 256)) (and (= (mod ~y$w_buff1_used~0_In-1066200631 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd1~0_In-1066200631 256)) .cse1))) (= ~y$w_buff1_used~0_In-1066200631 |P0Thread1of1ForFork1_#t~ite17_Out-1066200631|) (= |P0Thread1of1ForFork1_#t~ite18_Out-1066200631| |P0Thread1of1ForFork1_#t~ite17_Out-1066200631|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1066200631, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1066200631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1066200631, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-1066200631|, ~weak$$choice2~0=~weak$$choice2~0_In-1066200631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1066200631} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1066200631, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1066200631, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1066200631, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-1066200631|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-1066200631|, ~weak$$choice2~0=~weak$$choice2~0_In-1066200631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1066200631} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:04:12,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:04:12,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 22:04:12,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In891399814 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In891399814 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In891399814 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In891399814 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out891399814| ~y$r_buff1_thd2~0_In891399814) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out891399814|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In891399814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In891399814, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In891399814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In891399814} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In891399814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In891399814, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out891399814|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In891399814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In891399814} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:04:12,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:04:12,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:04:12,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1212842585 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1212842585 256) 0))) (or (and (= ~y$w_buff1~0_In1212842585 |ULTIMATE.start_main_#t~ite34_Out1212842585|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In1212842585 |ULTIMATE.start_main_#t~ite34_Out1212842585|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1212842585, ~y~0=~y~0_In1212842585, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1212842585, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1212842585} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1212842585, ~y~0=~y~0_In1212842585, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1212842585, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1212842585|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1212842585} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:04:12,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:04:12,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1081196651 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1081196651 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-1081196651|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1081196651 |ULTIMATE.start_main_#t~ite36_Out-1081196651|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1081196651, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1081196651} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1081196651, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1081196651, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1081196651|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 22:04:12,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In865696222 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In865696222 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In865696222 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In865696222 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out865696222|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In865696222 |ULTIMATE.start_main_#t~ite37_Out865696222|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In865696222, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In865696222, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In865696222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865696222} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In865696222, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In865696222, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out865696222|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In865696222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865696222} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 22:04:12,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-624791284 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-624791284 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-624791284| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-624791284| ~y$r_buff0_thd0~0_In-624791284) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-624791284, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-624791284} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-624791284, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-624791284, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-624791284|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 22:04:12,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-717275467 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-717275467 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-717275467 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-717275467 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-717275467|)) (and (= ~y$r_buff1_thd0~0_In-717275467 |ULTIMATE.start_main_#t~ite39_Out-717275467|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-717275467, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-717275467, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-717275467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-717275467} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-717275467, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-717275467|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-717275467, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-717275467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-717275467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 22:04:12,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:04:12,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:04:12 BasicIcfg [2019-12-18 22:04:12,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:04:12,863 INFO L168 Benchmark]: Toolchain (without parser) took 13694.28 ms. Allocated memory was 137.9 MB in the beginning and 708.8 MB in the end (delta: 570.9 MB). Free memory was 101.6 MB in the beginning and 295.6 MB in the end (delta: -194.1 MB). Peak memory consumption was 376.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:12,864 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:04:12,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.65 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 156.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:12,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.14 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 154.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:12,869 INFO L168 Benchmark]: Boogie Preprocessor took 38.54 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:12,870 INFO L168 Benchmark]: RCFGBuilder took 750.99 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 110.9 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:12,874 INFO L168 Benchmark]: TraceAbstraction took 12078.85 ms. Allocated memory was 202.4 MB in the beginning and 708.8 MB in the end (delta: 506.5 MB). Free memory was 110.2 MB in the beginning and 295.6 MB in the end (delta: -185.5 MB). Peak memory consumption was 321.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:12,880 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.65 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 156.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.14 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 154.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.54 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 750.99 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 110.9 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12078.85 ms. Allocated memory was 202.4 MB in the beginning and 708.8 MB in the end (delta: 506.5 MB). Free memory was 110.2 MB in the beginning and 295.6 MB in the end (delta: -185.5 MB). Peak memory consumption was 321.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1337 SDtfs, 1260 SDslu, 1863 SDs, 0 SdLazy, 745 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 6281 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 21838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...