/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/rfi000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:57:56,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:57:56,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:57:56,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:57:56,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:57:56,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:57:56,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:57:56,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:57:56,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:57:56,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:57:56,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:57:56,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:57:56,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:57:56,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:57:56,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:57:56,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:57:56,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:57:56,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:57:56,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:57:56,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:57:56,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:57:56,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:57:56,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:57:56,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:57:56,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:57:56,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:57:56,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:57:56,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:57:56,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:57:56,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:57:56,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:57:56,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:57:56,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:57:56,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:57:56,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:57:56,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:57:56,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:57:56,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:57:56,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:57:56,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:57:56,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:57:56,899 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 21:57:56,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:57:56,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:57:56,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:57:56,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:57:56,915 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:57:56,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:57:56,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:57:56,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:57:56,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:57:56,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:57:56,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:57:56,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:57:56,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:57:56,917 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:57:56,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:57:56,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:57:56,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:57:56,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:57:56,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:57:56,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:57:56,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:57:56,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:57:56,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:57:56,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:57:56,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:57:56,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:57:56,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:57:56,921 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:57:56,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:57:56,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:57:57,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:57:57,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:57:57,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:57:57,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:57:57,234 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:57:57,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc.i [2019-12-18 21:57:57,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3b4f9a0/e2d2f7b9184840678649a4715bd07c93/FLAG947d348b9 [2019-12-18 21:57:57,911 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:57:57,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc.i [2019-12-18 21:57:57,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3b4f9a0/e2d2f7b9184840678649a4715bd07c93/FLAG947d348b9 [2019-12-18 21:57:58,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3b4f9a0/e2d2f7b9184840678649a4715bd07c93 [2019-12-18 21:57:58,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:57:58,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:57:58,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:57:58,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:57:58,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:57:58,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:57:58" (1/1) ... [2019-12-18 21:57:58,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2418d655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:58, skipping insertion in model container [2019-12-18 21:57:58,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:57:58" (1/1) ... [2019-12-18 21:57:58,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:57:58,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:57:58,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:57:58,839 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:57:58,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:57:59,005 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:57:59,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59 WrapperNode [2019-12-18 21:57:59,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:57:59,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:57:59,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:57:59,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:57:59,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:57:59,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:57:59,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:57:59,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:57:59,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (1/1) ... [2019-12-18 21:57:59,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:57:59,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:57:59,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:57:59,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:57:59,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57: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 21:57:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:57:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:57:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:57:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:57:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:57:59,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:57:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:57:59,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:57:59,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:57:59,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:57:59,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:57:59,228 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 21:58:00,427 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:58:00,427 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:58:00,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:58:00 BoogieIcfgContainer [2019-12-18 21:58:00,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:58:00,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:58:00,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:58:00,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:58:00,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:57:58" (1/3) ... [2019-12-18 21:58:00,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfc05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:58:00, skipping insertion in model container [2019-12-18 21:58:00,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:59" (2/3) ... [2019-12-18 21:58:00,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfc05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:58:00, skipping insertion in model container [2019-12-18 21:58:00,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:58:00" (3/3) ... [2019-12-18 21:58:00,447 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc.i [2019-12-18 21:58:00,456 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:58:00,456 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:58:00,463 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:58:00,464 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:58:00,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,507 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,509 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:00,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:58:00,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:58:00,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:58:00,617 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:58:00,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:58:00,617 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:58:00,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:58:00,618 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:58:00,618 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:58:00,636 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-18 21:58:00,638 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-18 21:58:00,799 INFO L126 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-18 21:58:00,799 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:58:00,821 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-18 21:58:00,866 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-18 21:58:00,945 INFO L126 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-18 21:58:00,946 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:58:00,964 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-18 21:58:01,042 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-18 21:58:01,043 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:58:04,678 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:58:04,851 INFO L206 etLargeBlockEncoding]: Checked pairs total: 254260 [2019-12-18 21:58:04,851 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-18 21:58:04,855 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 192 transitions [2019-12-18 21:58:09,774 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 61532 states. [2019-12-18 21:58:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 61532 states. [2019-12-18 21:58:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:58:09,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:09,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:58:09,784 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1308418, now seen corresponding path program 1 times [2019-12-18 21:58:09,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:09,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870030864] [2019-12-18 21:58:09,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:09,990 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 21:58:09,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870030864] [2019-12-18 21:58:09,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:09,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:58:09,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504777957] [2019-12-18 21:58:09,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:09,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:10,014 INFO L87 Difference]: Start difference. First operand 61532 states. Second operand 3 states. [2019-12-18 21:58:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:11,285 INFO L93 Difference]: Finished difference Result 61201 states and 218127 transitions. [2019-12-18 21:58:11,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:11,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:58:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:11,737 INFO L225 Difference]: With dead ends: 61201 [2019-12-18 21:58:11,740 INFO L226 Difference]: Without dead ends: 60135 [2019-12-18 21:58:11,743 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 21:58:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60135 states. [2019-12-18 21:58:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60135 to 60135. [2019-12-18 21:58:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60135 states. [2019-12-18 21:58:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60135 states to 60135 states and 214522 transitions. [2019-12-18 21:58:16,258 INFO L78 Accepts]: Start accepts. Automaton has 60135 states and 214522 transitions. Word has length 3 [2019-12-18 21:58:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:16,259 INFO L462 AbstractCegarLoop]: Abstraction has 60135 states and 214522 transitions. [2019-12-18 21:58:16,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 60135 states and 214522 transitions. [2019-12-18 21:58:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:58:16,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:16,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:16,262 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2019764645, now seen corresponding path program 1 times [2019-12-18 21:58:16,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:16,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039879521] [2019-12-18 21:58:16,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:16,413 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 21:58:16,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039879521] [2019-12-18 21:58:16,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:16,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:16,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290270525] [2019-12-18 21:58:16,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:58:16,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:58:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:16,419 INFO L87 Difference]: Start difference. First operand 60135 states and 214522 transitions. Second operand 4 states. [2019-12-18 21:58:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:19,041 INFO L93 Difference]: Finished difference Result 81270 states and 280051 transitions. [2019-12-18 21:58:19,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:58:19,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:58:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:19,410 INFO L225 Difference]: With dead ends: 81270 [2019-12-18 21:58:19,410 INFO L226 Difference]: Without dead ends: 81270 [2019-12-18 21:58:19,411 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 21:58:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81270 states. [2019-12-18 21:58:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81270 to 81072. [2019-12-18 21:58:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81072 states. [2019-12-18 21:58:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81072 states to 81072 states and 279514 transitions. [2019-12-18 21:58:22,313 INFO L78 Accepts]: Start accepts. Automaton has 81072 states and 279514 transitions. Word has length 11 [2019-12-18 21:58:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:22,313 INFO L462 AbstractCegarLoop]: Abstraction has 81072 states and 279514 transitions. [2019-12-18 21:58:22,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:58:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 81072 states and 279514 transitions. [2019-12-18 21:58:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:58:22,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:22,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:22,320 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash -312179638, now seen corresponding path program 1 times [2019-12-18 21:58:22,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:22,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530967092] [2019-12-18 21:58:22,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:24,823 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 21:58:24,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530967092] [2019-12-18 21:58:24,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:24,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:24,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779474848] [2019-12-18 21:58:24,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:58:24,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:58:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:24,825 INFO L87 Difference]: Start difference. First operand 81072 states and 279514 transitions. Second operand 4 states. [2019-12-18 21:58:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:25,560 INFO L93 Difference]: Finished difference Result 98023 states and 334543 transitions. [2019-12-18 21:58:25,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:58:25,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:58:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:25,809 INFO L225 Difference]: With dead ends: 98023 [2019-12-18 21:58:25,809 INFO L226 Difference]: Without dead ends: 98023 [2019-12-18 21:58:25,810 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 21:58:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98023 states. [2019-12-18 21:58:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98023 to 91419. [2019-12-18 21:58:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91419 states. [2019-12-18 21:58:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91419 states to 91419 states and 312836 transitions. [2019-12-18 21:58:30,474 INFO L78 Accepts]: Start accepts. Automaton has 91419 states and 312836 transitions. Word has length 14 [2019-12-18 21:58:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:30,475 INFO L462 AbstractCegarLoop]: Abstraction has 91419 states and 312836 transitions. [2019-12-18 21:58:30,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:58:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 91419 states and 312836 transitions. [2019-12-18 21:58:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 21:58:30,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:30,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:30,485 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1657200338, now seen corresponding path program 1 times [2019-12-18 21:58:30,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:30,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384064690] [2019-12-18 21:58:30,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:30,568 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 21:58:30,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384064690] [2019-12-18 21:58:30,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:30,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:30,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287883057] [2019-12-18 21:58:30,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:58:30,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:58:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:30,570 INFO L87 Difference]: Start difference. First operand 91419 states and 312836 transitions. Second operand 4 states. [2019-12-18 21:58:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:30,643 INFO L93 Difference]: Finished difference Result 8836 states and 22781 transitions. [2019-12-18 21:58:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:58:30,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-18 21:58:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:30,656 INFO L225 Difference]: With dead ends: 8836 [2019-12-18 21:58:30,657 INFO L226 Difference]: Without dead ends: 7489 [2019-12-18 21:58:30,657 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 21:58:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2019-12-18 21:58:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 7481. [2019-12-18 21:58:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7481 states. [2019-12-18 21:58:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7481 states to 7481 states and 18430 transitions. [2019-12-18 21:58:30,792 INFO L78 Accepts]: Start accepts. Automaton has 7481 states and 18430 transitions. Word has length 20 [2019-12-18 21:58:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:30,792 INFO L462 AbstractCegarLoop]: Abstraction has 7481 states and 18430 transitions. [2019-12-18 21:58:30,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:58:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7481 states and 18430 transitions. [2019-12-18 21:58:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:58:30,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:30,797 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] [2019-12-18 21:58:30,797 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1306986868, now seen corresponding path program 1 times [2019-12-18 21:58:30,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:30,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265308392] [2019-12-18 21:58:30,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:30,949 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 21:58:30,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265308392] [2019-12-18 21:58:30,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:30,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:30,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779442589] [2019-12-18 21:58:30,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:58:30,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:30,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:58:30,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:30,954 INFO L87 Difference]: Start difference. First operand 7481 states and 18430 transitions. Second operand 5 states. [2019-12-18 21:58:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:31,981 INFO L93 Difference]: Finished difference Result 8567 states and 20880 transitions. [2019-12-18 21:58:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:58:31,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 21:58:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:31,995 INFO L225 Difference]: With dead ends: 8567 [2019-12-18 21:58:31,995 INFO L226 Difference]: Without dead ends: 8567 [2019-12-18 21:58:31,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:58:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2019-12-18 21:58:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 8465. [2019-12-18 21:58:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8465 states. [2019-12-18 21:58:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 20682 transitions. [2019-12-18 21:58:32,106 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 20682 transitions. Word has length 30 [2019-12-18 21:58:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:32,106 INFO L462 AbstractCegarLoop]: Abstraction has 8465 states and 20682 transitions. [2019-12-18 21:58:32,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:58:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 20682 transitions. [2019-12-18 21:58:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 21:58:32,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:32,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:32,110 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:32,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:32,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1861858661, now seen corresponding path program 1 times [2019-12-18 21:58:32,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:32,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901045962] [2019-12-18 21:58:32,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:32,182 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 21:58:32,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901045962] [2019-12-18 21:58:32,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:32,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:32,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382275269] [2019-12-18 21:58:32,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:32,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:32,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:32,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:32,185 INFO L87 Difference]: Start difference. First operand 8465 states and 20682 transitions. Second operand 3 states. [2019-12-18 21:58:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:32,310 INFO L93 Difference]: Finished difference Result 12677 states and 29440 transitions. [2019-12-18 21:58:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:32,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 21:58:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:32,325 INFO L225 Difference]: With dead ends: 12677 [2019-12-18 21:58:32,325 INFO L226 Difference]: Without dead ends: 12677 [2019-12-18 21:58:32,325 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 21:58:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12677 states. [2019-12-18 21:58:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12677 to 11628. [2019-12-18 21:58:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11628 states. [2019-12-18 21:58:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11628 states to 11628 states and 27275 transitions. [2019-12-18 21:58:32,480 INFO L78 Accepts]: Start accepts. Automaton has 11628 states and 27275 transitions. Word has length 31 [2019-12-18 21:58:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:32,481 INFO L462 AbstractCegarLoop]: Abstraction has 11628 states and 27275 transitions. [2019-12-18 21:58:32,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 11628 states and 27275 transitions. [2019-12-18 21:58:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:58:32,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:32,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:32,485 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:32,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:32,485 INFO L82 PathProgramCache]: Analyzing trace with hash -483432237, now seen corresponding path program 1 times [2019-12-18 21:58:32,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:32,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326345615] [2019-12-18 21:58:32,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:32,562 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 21:58:32,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326345615] [2019-12-18 21:58:32,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:32,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:32,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305991444] [2019-12-18 21:58:32,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:58:32,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:58:32,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:32,564 INFO L87 Difference]: Start difference. First operand 11628 states and 27275 transitions. Second operand 5 states. [2019-12-18 21:58:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:33,091 INFO L93 Difference]: Finished difference Result 13153 states and 30540 transitions. [2019-12-18 21:58:33,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:58:33,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 21:58:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:33,106 INFO L225 Difference]: With dead ends: 13153 [2019-12-18 21:58:33,107 INFO L226 Difference]: Without dead ends: 13153 [2019-12-18 21:58:33,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:58:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13153 states. [2019-12-18 21:58:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13153 to 11842. [2019-12-18 21:58:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-12-18 21:58:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 27752 transitions. [2019-12-18 21:58:33,241 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 27752 transitions. Word has length 33 [2019-12-18 21:58:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:33,242 INFO L462 AbstractCegarLoop]: Abstraction has 11842 states and 27752 transitions. [2019-12-18 21:58:33,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:58:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 27752 transitions. [2019-12-18 21:58:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:58:33,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:33,250 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 21:58:33,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:33,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2081393196, now seen corresponding path program 1 times [2019-12-18 21:58:33,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:33,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667249922] [2019-12-18 21:58:33,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:33,342 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 21:58:33,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667249922] [2019-12-18 21:58:33,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:33,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:58:33,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259681866] [2019-12-18 21:58:33,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:58:33,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:58:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:33,345 INFO L87 Difference]: Start difference. First operand 11842 states and 27752 transitions. Second operand 5 states. [2019-12-18 21:58:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:34,501 INFO L93 Difference]: Finished difference Result 13957 states and 32244 transitions. [2019-12-18 21:58:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:58:34,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 21:58:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:34,519 INFO L225 Difference]: With dead ends: 13957 [2019-12-18 21:58:34,519 INFO L226 Difference]: Without dead ends: 13957 [2019-12-18 21:58:34,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:58:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2019-12-18 21:58:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 13295. [2019-12-18 21:58:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13295 states. [2019-12-18 21:58:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 30887 transitions. [2019-12-18 21:58:35,535 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 30887 transitions. Word has length 42 [2019-12-18 21:58:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:35,535 INFO L462 AbstractCegarLoop]: Abstraction has 13295 states and 30887 transitions. [2019-12-18 21:58:35,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:58:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 30887 transitions. [2019-12-18 21:58:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 21:58:35,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:35,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:35,542 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash 428477981, now seen corresponding path program 1 times [2019-12-18 21:58:35,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:35,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642440556] [2019-12-18 21:58:35,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:35,622 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 21:58:35,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642440556] [2019-12-18 21:58:35,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:35,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:58:35,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574698446] [2019-12-18 21:58:35,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:58:35,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:58:35,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:58:35,625 INFO L87 Difference]: Start difference. First operand 13295 states and 30887 transitions. Second operand 6 states. [2019-12-18 21:58:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:36,376 INFO L93 Difference]: Finished difference Result 15410 states and 35255 transitions. [2019-12-18 21:58:36,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:58:36,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 21:58:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:36,396 INFO L225 Difference]: With dead ends: 15410 [2019-12-18 21:58:36,396 INFO L226 Difference]: Without dead ends: 15385 [2019-12-18 21:58:36,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:58:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15385 states. [2019-12-18 21:58:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15385 to 14466. [2019-12-18 21:58:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14466 states. [2019-12-18 21:58:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14466 states to 14466 states and 33448 transitions. [2019-12-18 21:58:36,566 INFO L78 Accepts]: Start accepts. Automaton has 14466 states and 33448 transitions. Word has length 43 [2019-12-18 21:58:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:36,566 INFO L462 AbstractCegarLoop]: Abstraction has 14466 states and 33448 transitions. [2019-12-18 21:58:36,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:58:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14466 states and 33448 transitions. [2019-12-18 21:58:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 21:58:36,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:36,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:36,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1666784848, now seen corresponding path program 1 times [2019-12-18 21:58:36,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:36,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876993462] [2019-12-18 21:58:36,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:36,669 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 21:58:36,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876993462] [2019-12-18 21:58:36,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:36,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:58:36,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128489385] [2019-12-18 21:58:36,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:58:36,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:58:36,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:36,672 INFO L87 Difference]: Start difference. First operand 14466 states and 33448 transitions. Second operand 5 states. [2019-12-18 21:58:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:36,726 INFO L93 Difference]: Finished difference Result 3468 states and 7339 transitions. [2019-12-18 21:58:36,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:58:36,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 21:58:36,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:36,733 INFO L225 Difference]: With dead ends: 3468 [2019-12-18 21:58:36,733 INFO L226 Difference]: Without dead ends: 3184 [2019-12-18 21:58:36,734 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 21:58:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-12-18 21:58:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 3003. [2019-12-18 21:58:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-12-18 21:58:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 6400 transitions. [2019-12-18 21:58:36,779 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 6400 transitions. Word has length 43 [2019-12-18 21:58:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:36,779 INFO L462 AbstractCegarLoop]: Abstraction has 3003 states and 6400 transitions. [2019-12-18 21:58:36,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:58:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 6400 transitions. [2019-12-18 21:58:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 21:58:36,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:36,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:36,785 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1149224758, now seen corresponding path program 1 times [2019-12-18 21:58:36,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:36,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590961121] [2019-12-18 21:58:36,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:36,841 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 21:58:36,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590961121] [2019-12-18 21:58:36,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:36,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:36,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540970426] [2019-12-18 21:58:36,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:36,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:36,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:36,844 INFO L87 Difference]: Start difference. First operand 3003 states and 6400 transitions. Second operand 3 states. [2019-12-18 21:58:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:36,928 INFO L93 Difference]: Finished difference Result 3346 states and 6732 transitions. [2019-12-18 21:58:36,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:36,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-18 21:58:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:36,933 INFO L225 Difference]: With dead ends: 3346 [2019-12-18 21:58:36,933 INFO L226 Difference]: Without dead ends: 3346 [2019-12-18 21:58:36,934 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 21:58:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-18 21:58:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2967. [2019-12-18 21:58:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2967 states. [2019-12-18 21:58:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 6009 transitions. [2019-12-18 21:58:36,968 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 6009 transitions. Word has length 46 [2019-12-18 21:58:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:36,968 INFO L462 AbstractCegarLoop]: Abstraction has 2967 states and 6009 transitions. [2019-12-18 21:58:36,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 6009 transitions. [2019-12-18 21:58:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-18 21:58:36,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:36,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:36,972 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:36,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:36,972 INFO L82 PathProgramCache]: Analyzing trace with hash -549380219, now seen corresponding path program 1 times [2019-12-18 21:58:36,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:36,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282156011] [2019-12-18 21:58:36,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:37,061 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 21:58:37,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282156011] [2019-12-18 21:58:37,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:37,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:58:37,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800436066] [2019-12-18 21:58:37,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:58:37,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:37,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:58:37,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:58:37,063 INFO L87 Difference]: Start difference. First operand 2967 states and 6009 transitions. Second operand 6 states. [2019-12-18 21:58:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:37,415 INFO L93 Difference]: Finished difference Result 3202 states and 6432 transitions. [2019-12-18 21:58:37,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:58:37,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-18 21:58:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:37,420 INFO L225 Difference]: With dead ends: 3202 [2019-12-18 21:58:37,420 INFO L226 Difference]: Without dead ends: 3134 [2019-12-18 21:58:37,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:58:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2019-12-18 21:58:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2882. [2019-12-18 21:58:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2019-12-18 21:58:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 5827 transitions. [2019-12-18 21:58:37,448 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 5827 transitions. Word has length 49 [2019-12-18 21:58:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:37,449 INFO L462 AbstractCegarLoop]: Abstraction has 2882 states and 5827 transitions. [2019-12-18 21:58:37,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:58:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 5827 transitions. [2019-12-18 21:58:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 21:58:37,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:37,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:37,455 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1384279063, now seen corresponding path program 1 times [2019-12-18 21:58:37,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:37,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618352011] [2019-12-18 21:58:37,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:37,583 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 21:58:37,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618352011] [2019-12-18 21:58:37,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:37,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:58:37,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080960245] [2019-12-18 21:58:37,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:58:37,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:58:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:37,585 INFO L87 Difference]: Start difference. First operand 2882 states and 5827 transitions. Second operand 5 states. [2019-12-18 21:58:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:37,791 INFO L93 Difference]: Finished difference Result 4499 states and 9108 transitions. [2019-12-18 21:58:37,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:58:37,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-18 21:58:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:37,799 INFO L225 Difference]: With dead ends: 4499 [2019-12-18 21:58:37,799 INFO L226 Difference]: Without dead ends: 4499 [2019-12-18 21:58:37,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 21:58:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-12-18 21:58:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 3832. [2019-12-18 21:58:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3832 states. [2019-12-18 21:58:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 7842 transitions. [2019-12-18 21:58:37,874 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 7842 transitions. Word has length 85 [2019-12-18 21:58:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:37,875 INFO L462 AbstractCegarLoop]: Abstraction has 3832 states and 7842 transitions. [2019-12-18 21:58:37,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:58:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 7842 transitions. [2019-12-18 21:58:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 21:58:37,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:37,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:37,884 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2146217659, now seen corresponding path program 1 times [2019-12-18 21:58:37,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:37,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260857082] [2019-12-18 21:58:37,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:38,050 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 21:58:38,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260857082] [2019-12-18 21:58:38,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:38,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:38,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806054808] [2019-12-18 21:58:38,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:38,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:38,052 INFO L87 Difference]: Start difference. First operand 3832 states and 7842 transitions. Second operand 3 states. [2019-12-18 21:58:38,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:38,127 INFO L93 Difference]: Finished difference Result 3831 states and 7840 transitions. [2019-12-18 21:58:38,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:38,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-18 21:58:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:38,132 INFO L225 Difference]: With dead ends: 3831 [2019-12-18 21:58:38,132 INFO L226 Difference]: Without dead ends: 3831 [2019-12-18 21:58:38,133 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 21:58:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2019-12-18 21:58:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3457. [2019-12-18 21:58:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2019-12-18 21:58:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 7134 transitions. [2019-12-18 21:58:38,194 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 7134 transitions. Word has length 86 [2019-12-18 21:58:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:38,195 INFO L462 AbstractCegarLoop]: Abstraction has 3457 states and 7134 transitions. [2019-12-18 21:58:38,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 7134 transitions. [2019-12-18 21:58:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:58:38,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:38,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:38,203 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash -618624095, now seen corresponding path program 1 times [2019-12-18 21:58:38,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:38,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836859080] [2019-12-18 21:58:38,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:38,415 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 21:58:38,492 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 21:58:38,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836859080] [2019-12-18 21:58:38,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:38,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:58:38,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687618993] [2019-12-18 21:58:38,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:58:38,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:58:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:58:38,494 INFO L87 Difference]: Start difference. First operand 3457 states and 7134 transitions. Second operand 9 states. [2019-12-18 21:58:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:39,559 INFO L93 Difference]: Finished difference Result 12059 states and 24791 transitions. [2019-12-18 21:58:39,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:58:39,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-18 21:58:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:39,569 INFO L225 Difference]: With dead ends: 12059 [2019-12-18 21:58:39,569 INFO L226 Difference]: Without dead ends: 9304 [2019-12-18 21:58:39,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:58:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2019-12-18 21:58:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 3541. [2019-12-18 21:58:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3541 states. [2019-12-18 21:58:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 7277 transitions. [2019-12-18 21:58:39,625 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 7277 transitions. Word has length 87 [2019-12-18 21:58:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:39,625 INFO L462 AbstractCegarLoop]: Abstraction has 3541 states and 7277 transitions. [2019-12-18 21:58:39,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:58:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 7277 transitions. [2019-12-18 21:58:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:58:39,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:39,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:39,629 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1610652577, now seen corresponding path program 2 times [2019-12-18 21:58:39,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:39,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312702642] [2019-12-18 21:58:39,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:39,826 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 21:58:39,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312702642] [2019-12-18 21:58:39,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:39,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:58:39,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923908300] [2019-12-18 21:58:39,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:58:39,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:58:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:58:39,830 INFO L87 Difference]: Start difference. First operand 3541 states and 7277 transitions. Second operand 9 states. [2019-12-18 21:58:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:40,755 INFO L93 Difference]: Finished difference Result 9645 states and 19793 transitions. [2019-12-18 21:58:40,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:58:40,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-18 21:58:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:40,765 INFO L225 Difference]: With dead ends: 9645 [2019-12-18 21:58:40,765 INFO L226 Difference]: Without dead ends: 7544 [2019-12-18 21:58:40,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:58:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-12-18 21:58:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 3884. [2019-12-18 21:58:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3884 states. [2019-12-18 21:58:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 7948 transitions. [2019-12-18 21:58:40,845 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 7948 transitions. Word has length 87 [2019-12-18 21:58:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:40,845 INFO L462 AbstractCegarLoop]: Abstraction has 3884 states and 7948 transitions. [2019-12-18 21:58:40,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:58:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 7948 transitions. [2019-12-18 21:58:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:58:40,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:40,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:40,853 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2019008161, now seen corresponding path program 3 times [2019-12-18 21:58:40,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:40,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009971716] [2019-12-18 21:58:40,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:40,992 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 21:58:40,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009971716] [2019-12-18 21:58:40,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:40,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:58:40,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765696281] [2019-12-18 21:58:40,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:58:40,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:40,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:58:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:40,996 INFO L87 Difference]: Start difference. First operand 3884 states and 7948 transitions. Second operand 4 states. [2019-12-18 21:58:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:41,049 INFO L93 Difference]: Finished difference Result 6402 states and 13099 transitions. [2019-12-18 21:58:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:58:41,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-18 21:58:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:41,054 INFO L225 Difference]: With dead ends: 6402 [2019-12-18 21:58:41,054 INFO L226 Difference]: Without dead ends: 2595 [2019-12-18 21:58:41,055 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 21:58:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-12-18 21:58:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2595. [2019-12-18 21:58:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2019-12-18 21:58:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 5298 transitions. [2019-12-18 21:58:41,096 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 5298 transitions. Word has length 87 [2019-12-18 21:58:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:41,097 INFO L462 AbstractCegarLoop]: Abstraction has 2595 states and 5298 transitions. [2019-12-18 21:58:41,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:58:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 5298 transitions. [2019-12-18 21:58:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:58:41,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:41,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:41,104 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1160744719, now seen corresponding path program 4 times [2019-12-18 21:58:41,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:41,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526991994] [2019-12-18 21:58:41,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:41,824 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 21:58:41,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526991994] [2019-12-18 21:58:41,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:41,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 21:58:41,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326053242] [2019-12-18 21:58:41,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 21:58:41,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 21:58:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-12-18 21:58:41,826 INFO L87 Difference]: Start difference. First operand 2595 states and 5298 transitions. Second operand 23 states. [2019-12-18 21:58:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:43,751 INFO L93 Difference]: Finished difference Result 5667 states and 11340 transitions. [2019-12-18 21:58:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 21:58:43,751 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2019-12-18 21:58:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:43,758 INFO L225 Difference]: With dead ends: 5667 [2019-12-18 21:58:43,758 INFO L226 Difference]: Without dead ends: 5626 [2019-12-18 21:58:43,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 21:58:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2019-12-18 21:58:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 3540. [2019-12-18 21:58:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2019-12-18 21:58:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 7155 transitions. [2019-12-18 21:58:43,803 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 7155 transitions. Word has length 87 [2019-12-18 21:58:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:43,803 INFO L462 AbstractCegarLoop]: Abstraction has 3540 states and 7155 transitions. [2019-12-18 21:58:43,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 21:58:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 7155 transitions. [2019-12-18 21:58:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:58:43,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:43,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:43,808 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash -4069085, now seen corresponding path program 5 times [2019-12-18 21:58:43,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:43,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49677118] [2019-12-18 21:58:43,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:58:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:58:43,951 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:58:43,951 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:58:43,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1293] [1293] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$r_buff0_thd2~0_106) (= v_~y$r_buff0_thd1~0_24 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_59) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1_used~0_95 0) (= 0 v_~y$w_buff0~0_45) (= v_~y$w_buff0_used~0_180 0) (= |v_#valid_48| (store .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_20| 1)) (= |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_46 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_20|) |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0)) |v_#memory_int_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_20|)) (= v_~y$r_buff0_thd0~0_62 0) (= 0 v_~y$r_buff1_thd1~0_18) (= 0 v_~weak$$choice2~0_44) (= 0 |v_#NULL.base_7|) (= 0 v_~y$r_buff1_thd0~0_34) (= 0 v_~y$flush_delayed~0_26) (= v_~y$mem_tmp~0_12 0) (= 0 v_~y$w_buff1~0_41) (= v_~x~0_12 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1585~0.base_20|) (= v_~__unbuffered_p1_EBX~0_11 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1585~0.base_20| 4)) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_10|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_10|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_14|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_8|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_12|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_13|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_12|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_12|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, #length=|v_#length_17|, ULTIMATE.start_main_~#t1585~0.offset=|v_ULTIMATE.start_main_~#t1585~0.offset_16|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_7|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_12|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_14|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_12|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_13|, ~y$w_buff1~0=v_~y$w_buff1~0_41, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_13|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_12, ~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_180, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t1585~0.base=|v_ULTIMATE.start_main_~#t1585~0.base_20|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_10|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_10|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_14|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_12|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_23|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_45, ~y~0=v_~y~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_13|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_14|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ULTIMATE.start_main_~#t1586~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1585~0.offset, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1585~0.base, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_~#t1586~0.offset, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:58:43,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1259] [1259] L813-1-->L815: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1586~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1586~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1586~0.offset_9| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10|) |v_ULTIMATE.start_main_~#t1586~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_10|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1586~0.base, ULTIMATE.start_main_~#t1586~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-18 21:58:43,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_32 v_~y$w_buff1~0_29) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~y$w_buff0~0_31) (= v_~y$w_buff1_used~0_83 v_~y$w_buff0_used~0_153) (= v_~y$w_buff0_used~0_152 1) (= (mod v_~y$w_buff1_used~0_83 256) 0) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff0~0=v_~y$w_buff0~0_32, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_31, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:58:43,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1171901715 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1171901715| ~y$mem_tmp~0_In-1171901715) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1171901715| ~y~0_In-1171901715) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1171901715, ~y$flush_delayed~0=~y$flush_delayed~0_In-1171901715, ~y~0=~y~0_In-1171901715} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1171901715, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1171901715|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1171901715, ~y~0=~y~0_In-1171901715} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:58:43,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1967953608 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out1967953608| ~y~0_In1967953608)) (and (not .cse0) (= ~y$mem_tmp~0_In1967953608 |P1Thread1of1ForFork1_#t~ite54_Out1967953608|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1967953608, ~y$flush_delayed~0=~y$flush_delayed~0_In1967953608, ~y~0=~y~0_In1967953608} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1967953608, ~y$flush_delayed~0=~y$flush_delayed~0_In1967953608, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1967953608|, ~y~0=~y~0_In1967953608} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 21:58:43,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In774867545 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In774867545 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out774867545|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In774867545 |P0Thread1of1ForFork0_#t~ite5_Out774867545|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In774867545, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In774867545} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out774867545|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In774867545, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In774867545} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:58:43,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In737307709 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In737307709 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In737307709 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In737307709 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out737307709| ~y$w_buff1_used~0_In737307709) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out737307709| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In737307709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In737307709, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In737307709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In737307709} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out737307709|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In737307709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In737307709, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In737307709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In737307709} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:58:43,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1750282783 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1750282783 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1750282783 ~y$r_buff0_thd1~0_Out1750282783)) (and (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1750282783) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1750282783, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1750282783} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1750282783, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1750282783|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1750282783} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:58:43,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1785285917 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1785285917 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1785285917 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1785285917 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1785285917|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In1785285917 |P0Thread1of1ForFork0_#t~ite8_Out1785285917|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1785285917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1785285917, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1785285917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1785285917} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1785285917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1785285917, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1785285917|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1785285917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1785285917} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:58:43,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1252] [1252] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:58:43,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-505199259 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-505199259 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite56_Out-505199259| |P1Thread1of1ForFork1_#t~ite55_Out-505199259|))) (or (and .cse0 (= ~y$w_buff1~0_In-505199259 |P1Thread1of1ForFork1_#t~ite55_Out-505199259|) (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~y~0_In-505199259 |P1Thread1of1ForFork1_#t~ite55_Out-505199259|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-505199259, ~y$w_buff1~0=~y$w_buff1~0_In-505199259, ~y~0=~y~0_In-505199259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-505199259} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-505199259, ~y$w_buff1~0=~y$w_buff1~0_In-505199259, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-505199259|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-505199259|, ~y~0=~y~0_In-505199259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-505199259} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-18 21:58:43,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1396305588 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1396305588 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out1396305588|)) (and (= ~y$w_buff0_used~0_In1396305588 |P1Thread1of1ForFork1_#t~ite57_Out1396305588|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1396305588, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1396305588} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1396305588, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1396305588, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1396305588|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-18 21:58:43,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2121859941 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2121859941 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-2121859941 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2121859941 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-2121859941|)) (and (= ~y$w_buff1_used~0_In-2121859941 |P1Thread1of1ForFork1_#t~ite58_Out-2121859941|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2121859941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2121859941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2121859941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121859941} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2121859941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2121859941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2121859941, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-2121859941|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121859941} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-18 21:58:43,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In579533951 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In579533951 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In579533951 |P1Thread1of1ForFork1_#t~ite59_Out579533951|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite59_Out579533951|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In579533951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In579533951} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In579533951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In579533951, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out579533951|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-18 21:58:43,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In182714568 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In182714568 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In182714568 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In182714568 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In182714568 |P1Thread1of1ForFork1_#t~ite60_Out182714568|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite60_Out182714568|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In182714568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In182714568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In182714568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In182714568} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In182714568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In182714568, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out182714568|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In182714568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In182714568} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-18 21:58:43,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~y$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork1_#t~ite60_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:58:43,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~y$r_buff0_thd0~0_52 256) 0) (= 0 (mod v_~y$w_buff0_used~0_147 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:58:43,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-329382472 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-329382472 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-329382472| ~y~0_In-329382472) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-329382472| ~y$w_buff1~0_In-329382472) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-329382472, ~y~0=~y~0_In-329382472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-329382472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-329382472} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-329382472|, ~y$w_buff1~0=~y$w_buff1~0_In-329382472, ~y~0=~y~0_In-329382472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-329382472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-329382472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 21:58:43,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite63_7|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_7|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_6|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 21:58:43,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-488831629 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-488831629 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out-488831629| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-488831629 |ULTIMATE.start_main_#t~ite65_Out-488831629|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-488831629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-488831629} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-488831629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-488831629, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-488831629|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-18 21:58:43,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In11226404 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In11226404 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In11226404 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In11226404 256)))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out11226404| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out11226404| ~y$w_buff1_used~0_In11226404) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In11226404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In11226404, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In11226404, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11226404} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In11226404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In11226404, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out11226404|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In11226404, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11226404} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-18 21:58:43,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In282384622 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In282384622 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out282384622| ~y$r_buff0_thd0~0_In282384622) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out282384622| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In282384622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282384622} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In282384622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282384622, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out282384622|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-18 21:58:43,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1508189098 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1508189098 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1508189098 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1508189098 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-1508189098|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1508189098 |ULTIMATE.start_main_#t~ite68_Out-1508189098|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508189098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1508189098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1508189098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508189098} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1508189098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1508189098, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1508189098|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1508189098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1508189098} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 21:58:44,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In604010329 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out604010329| ~y~0_In604010329)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out604010329| ~y$mem_tmp~0_In604010329)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In604010329, ~y$flush_delayed~0=~y$flush_delayed~0_In604010329, ~y~0=~y~0_In604010329} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In604010329, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out604010329|, ~y$flush_delayed~0=~y$flush_delayed~0_In604010329, ~y~0=~y~0_In604010329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-18 21:58:44,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1276] [1276] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~y$flush_delayed~0_18) (= v_~y~0_38 |v_ULTIMATE.start_main_#t~ite91_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:58:44,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:58:44 BasicIcfg [2019-12-18 21:58:44,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:58:44,138 INFO L168 Benchmark]: Toolchain (without parser) took 45973.25 ms. Allocated memory was 144.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 99.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 355.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:44,139 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:58:44,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.63 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 152.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:44,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.77 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:44,141 INFO L168 Benchmark]: Boogie Preprocessor took 65.25 ms. Allocated memory is still 201.9 MB. Free memory was 149.4 MB in the beginning and 145.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:44,142 INFO L168 Benchmark]: RCFGBuilder took 1283.48 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 145.6 MB in the beginning and 193.9 MB in the end (delta: -48.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:44,142 INFO L168 Benchmark]: TraceAbstraction took 43706.43 ms. Allocated memory was 234.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 193.9 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 360.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:58:44,145 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.53 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 837.63 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 152.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.77 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.25 ms. Allocated memory is still 201.9 MB. Free memory was 149.4 MB in the beginning and 145.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1283.48 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 145.6 MB in the beginning and 193.9 MB in the end (delta: -48.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43706.43 ms. Allocated memory was 234.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 193.9 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 360.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 231 ProgramPointsBefore, 154 ProgramPointsAfterwards, 307 TransitionsBefore, 192 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 67 ConcurrentYvCompositions, 41 ChoiceCompositions, 14327 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 254260 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L815] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L790] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 43.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6555 SDtfs, 5195 SDslu, 21197 SDs, 0 SdLazy, 6727 SolverSat, 289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91419occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 24215 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 971 NumberOfCodeBlocks, 971 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 866 ConstructedInterpolants, 0 QuantifiedInterpolants, 314522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...