/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:24:44,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:24:44,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:24:44,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:24:44,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:24:44,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:24:44,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:24:44,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:24:44,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:24:44,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:24:44,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:24:44,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:24:44,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:24:44,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:24:44,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:24:44,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:24:44,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:24:44,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:24:44,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:24:44,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:24:44,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:24:44,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:24:44,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:24:44,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:24:44,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:24:44,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:24:44,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:24:44,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:24:44,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:24:44,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:24:44,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:24:44,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:24:44,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:24:44,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:24:44,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:24:44,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:24:44,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:24:44,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:24:44,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:24:44,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:24:44,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:24:44,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:24:45,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:24:45,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:24:45,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:24:45,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:24:45,002 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:24:45,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:24:45,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:24:45,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:24:45,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:24:45,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:24:45,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:24:45,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:24:45,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:24:45,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:24:45,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:24:45,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:24:45,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:24:45,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:24:45,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:24:45,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:24:45,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:24:45,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:24:45,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:24:45,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:24:45,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:24:45,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:24:45,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:24:45,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:24:45,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:24:45,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:24:45,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:24:45,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:24:45,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:24:45,293 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:24:45,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i [2019-12-27 01:24:45,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b683424c/f5c3e726ab134df1ada2140cdf9a280d/FLAG11f5eebf3 [2019-12-27 01:24:46,002 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:24:46,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i [2019-12-27 01:24:46,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b683424c/f5c3e726ab134df1ada2140cdf9a280d/FLAG11f5eebf3 [2019-12-27 01:24:46,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b683424c/f5c3e726ab134df1ada2140cdf9a280d [2019-12-27 01:24:46,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:24:46,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:24:46,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:24:46,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:24:46,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:24:46,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:24:46" (1/1) ... [2019-12-27 01:24:46,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51159066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:46, skipping insertion in model container [2019-12-27 01:24:46,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:24:46" (1/1) ... [2019-12-27 01:24:46,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:24:46,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:24:46,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:24:46,852 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:24:46,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:24:47,006 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:24:47,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47 WrapperNode [2019-12-27 01:24:47,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:24:47,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:24:47,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:24:47,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:24:47,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:24:47,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:24:47,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:24:47,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:24:47,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... [2019-12-27 01:24:47,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:24:47,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:24:47,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:24:47,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:24:47,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:24:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:24:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:24:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:24:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:24:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:24:47,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:24:47,200 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:24:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:24:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:24:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:24:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:24:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:24:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:24:47,207 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:24:48,153 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:24:48,153 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:24:48,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:24:48 BoogieIcfgContainer [2019-12-27 01:24:48,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:24:48,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:24:48,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:24:48,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:24:48,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:24:46" (1/3) ... [2019-12-27 01:24:48,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0b27ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:24:48, skipping insertion in model container [2019-12-27 01:24:48,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:47" (2/3) ... [2019-12-27 01:24:48,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0b27ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:24:48, skipping insertion in model container [2019-12-27 01:24:48,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:24:48" (3/3) ... [2019-12-27 01:24:48,163 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_rmo.opt.i [2019-12-27 01:24:48,174 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:24:48,174 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:24:48,181 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:24:48,182 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:24:48,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,255 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,255 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,321 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:48,338 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:24:48,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:24:48,358 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:24:48,358 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:24:48,358 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:24:48,358 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:24:48,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:24:48,359 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:24:48,359 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:24:48,375 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-27 01:24:48,377 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 01:24:48,531 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 01:24:48,531 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:24:48,548 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 568 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 01:24:48,578 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 01:24:48,641 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 01:24:48,641 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:24:48,654 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 568 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 01:24:48,689 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 01:24:48,690 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:24:55,091 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 01:24:55,225 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 01:24:55,254 INFO L206 etLargeBlockEncoding]: Checked pairs total: 138188 [2019-12-27 01:24:55,254 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-27 01:24:55,257 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 129 transitions [2019-12-27 01:24:58,898 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-27 01:24:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-27 01:24:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 01:24:58,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:24:58,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:24:58,908 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:24:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:24:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1166715454, now seen corresponding path program 1 times [2019-12-27 01:24:58,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:24:58,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851989550] [2019-12-27 01:24:58,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:24:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:24:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:24:59,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851989550] [2019-12-27 01:24:59,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:24:59,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:24:59,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429085792] [2019-12-27 01:24:59,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:24:59,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:24:59,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:24:59,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:24:59,193 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-27 01:24:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:24:59,888 INFO L93 Difference]: Finished difference Result 43270 states and 177632 transitions. [2019-12-27 01:24:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:24:59,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 01:24:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:00,318 INFO L225 Difference]: With dead ends: 43270 [2019-12-27 01:25:00,318 INFO L226 Difference]: Without dead ends: 40300 [2019-12-27 01:25:00,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40300 states. [2019-12-27 01:25:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40300 to 40300. [2019-12-27 01:25:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40300 states. [2019-12-27 01:25:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 165323 transitions. [2019-12-27 01:25:03,869 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 165323 transitions. Word has length 7 [2019-12-27 01:25:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:03,871 INFO L462 AbstractCegarLoop]: Abstraction has 40300 states and 165323 transitions. [2019-12-27 01:25:03,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 165323 transitions. [2019-12-27 01:25:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:25:03,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:03,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:03,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:03,884 INFO L82 PathProgramCache]: Analyzing trace with hash 446345132, now seen corresponding path program 1 times [2019-12-27 01:25:03,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:03,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527253831] [2019-12-27 01:25:03,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:04,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527253831] [2019-12-27 01:25:04,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:04,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:04,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757213801] [2019-12-27 01:25:04,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:25:04,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:25:04,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:25:04,114 INFO L87 Difference]: Start difference. First operand 40300 states and 165323 transitions. Second operand 4 states. [2019-12-27 01:25:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:06,553 INFO L93 Difference]: Finished difference Result 64232 states and 253053 transitions. [2019-12-27 01:25:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:25:06,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 01:25:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:06,901 INFO L225 Difference]: With dead ends: 64232 [2019-12-27 01:25:06,901 INFO L226 Difference]: Without dead ends: 64202 [2019-12-27 01:25:06,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64202 states. [2019-12-27 01:25:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64202 to 62556. [2019-12-27 01:25:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62556 states. [2019-12-27 01:25:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62556 states to 62556 states and 247863 transitions. [2019-12-27 01:25:09,809 INFO L78 Accepts]: Start accepts. Automaton has 62556 states and 247863 transitions. Word has length 13 [2019-12-27 01:25:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:09,810 INFO L462 AbstractCegarLoop]: Abstraction has 62556 states and 247863 transitions. [2019-12-27 01:25:09,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:25:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 62556 states and 247863 transitions. [2019-12-27 01:25:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:25:09,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:09,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:09,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1030418596, now seen corresponding path program 1 times [2019-12-27 01:25:09,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:09,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138825903] [2019-12-27 01:25:09,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:09,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138825903] [2019-12-27 01:25:09,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:09,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:09,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815631439] [2019-12-27 01:25:09,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:25:09,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:25:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:25:09,891 INFO L87 Difference]: Start difference. First operand 62556 states and 247863 transitions. Second operand 4 states. [2019-12-27 01:25:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:13,185 INFO L93 Difference]: Finished difference Result 80364 states and 313729 transitions. [2019-12-27 01:25:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:25:13,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:25:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:13,428 INFO L225 Difference]: With dead ends: 80364 [2019-12-27 01:25:13,429 INFO L226 Difference]: Without dead ends: 80336 [2019-12-27 01:25:13,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80336 states. [2019-12-27 01:25:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80336 to 71524. [2019-12-27 01:25:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71524 states. [2019-12-27 01:25:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71524 states to 71524 states and 281953 transitions. [2019-12-27 01:25:16,240 INFO L78 Accepts]: Start accepts. Automaton has 71524 states and 281953 transitions. Word has length 16 [2019-12-27 01:25:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:16,240 INFO L462 AbstractCegarLoop]: Abstraction has 71524 states and 281953 transitions. [2019-12-27 01:25:16,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:25:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 71524 states and 281953 transitions. [2019-12-27 01:25:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 01:25:16,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:16,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:16,250 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:16,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:16,250 INFO L82 PathProgramCache]: Analyzing trace with hash -239561606, now seen corresponding path program 1 times [2019-12-27 01:25:16,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:16,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554290052] [2019-12-27 01:25:16,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:16,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554290052] [2019-12-27 01:25:16,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:16,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:25:16,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721603466] [2019-12-27 01:25:16,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:16,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:16,302 INFO L87 Difference]: Start difference. First operand 71524 states and 281953 transitions. Second operand 3 states. [2019-12-27 01:25:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:16,615 INFO L93 Difference]: Finished difference Result 71342 states and 281280 transitions. [2019-12-27 01:25:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:16,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 01:25:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:16,800 INFO L225 Difference]: With dead ends: 71342 [2019-12-27 01:25:16,800 INFO L226 Difference]: Without dead ends: 71342 [2019-12-27 01:25:16,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71342 states. [2019-12-27 01:25:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71342 to 71342. [2019-12-27 01:25:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71342 states. [2019-12-27 01:25:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71342 states to 71342 states and 281280 transitions. [2019-12-27 01:25:19,897 INFO L78 Accepts]: Start accepts. Automaton has 71342 states and 281280 transitions. Word has length 18 [2019-12-27 01:25:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:19,897 INFO L462 AbstractCegarLoop]: Abstraction has 71342 states and 281280 transitions. [2019-12-27 01:25:19,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71342 states and 281280 transitions. [2019-12-27 01:25:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 01:25:19,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:19,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:19,909 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 958906877, now seen corresponding path program 1 times [2019-12-27 01:25:19,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:19,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377174654] [2019-12-27 01:25:19,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:19,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377174654] [2019-12-27 01:25:19,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:19,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:25:19,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145529301] [2019-12-27 01:25:19,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:19,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:19,971 INFO L87 Difference]: Start difference. First operand 71342 states and 281280 transitions. Second operand 3 states. [2019-12-27 01:25:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:20,309 INFO L93 Difference]: Finished difference Result 67060 states and 263983 transitions. [2019-12-27 01:25:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:20,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 01:25:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:21,140 INFO L225 Difference]: With dead ends: 67060 [2019-12-27 01:25:21,140 INFO L226 Difference]: Without dead ends: 67060 [2019-12-27 01:25:21,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67060 states. [2019-12-27 01:25:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67060 to 67060. [2019-12-27 01:25:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67060 states. [2019-12-27 01:25:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67060 states to 67060 states and 263983 transitions. [2019-12-27 01:25:23,467 INFO L78 Accepts]: Start accepts. Automaton has 67060 states and 263983 transitions. Word has length 19 [2019-12-27 01:25:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:23,467 INFO L462 AbstractCegarLoop]: Abstraction has 67060 states and 263983 transitions. [2019-12-27 01:25:23,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 67060 states and 263983 transitions. [2019-12-27 01:25:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:25:23,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:23,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:23,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash 81142022, now seen corresponding path program 1 times [2019-12-27 01:25:23,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:23,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524970741] [2019-12-27 01:25:23,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:23,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524970741] [2019-12-27 01:25:23,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:23,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:25:23,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589291851] [2019-12-27 01:25:23,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:25:23,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:25:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:23,593 INFO L87 Difference]: Start difference. First operand 67060 states and 263983 transitions. Second operand 5 states. [2019-12-27 01:25:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:25,201 INFO L93 Difference]: Finished difference Result 80108 states and 311049 transitions. [2019-12-27 01:25:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:25:25,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:25:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:25,391 INFO L225 Difference]: With dead ends: 80108 [2019-12-27 01:25:25,391 INFO L226 Difference]: Without dead ends: 80056 [2019-12-27 01:25:25,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80056 states. [2019-12-27 01:25:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80056 to 66648. [2019-12-27 01:25:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66648 states. [2019-12-27 01:25:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66648 states to 66648 states and 262519 transitions. [2019-12-27 01:25:27,689 INFO L78 Accepts]: Start accepts. Automaton has 66648 states and 262519 transitions. Word has length 22 [2019-12-27 01:25:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:27,690 INFO L462 AbstractCegarLoop]: Abstraction has 66648 states and 262519 transitions. [2019-12-27 01:25:27,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:25:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 66648 states and 262519 transitions. [2019-12-27 01:25:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:25:27,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:27,764 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-27 01:25:27,764 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -369432244, now seen corresponding path program 1 times [2019-12-27 01:25:27,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:27,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376391967] [2019-12-27 01:25:27,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:27,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376391967] [2019-12-27 01:25:27,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:27,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:25:27,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924122355] [2019-12-27 01:25:27,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:25:27,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:25:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:27,839 INFO L87 Difference]: Start difference. First operand 66648 states and 262519 transitions. Second operand 5 states. [2019-12-27 01:25:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:29,016 INFO L93 Difference]: Finished difference Result 100608 states and 402187 transitions. [2019-12-27 01:25:29,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:25:29,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 01:25:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:29,265 INFO L225 Difference]: With dead ends: 100608 [2019-12-27 01:25:29,265 INFO L226 Difference]: Without dead ends: 88344 [2019-12-27 01:25:29,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:25:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88344 states. [2019-12-27 01:25:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88344 to 88344. [2019-12-27 01:25:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88344 states. [2019-12-27 01:25:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88344 states to 88344 states and 354077 transitions. [2019-12-27 01:25:32,029 INFO L78 Accepts]: Start accepts. Automaton has 88344 states and 354077 transitions. Word has length 33 [2019-12-27 01:25:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:32,030 INFO L462 AbstractCegarLoop]: Abstraction has 88344 states and 354077 transitions. [2019-12-27 01:25:32,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:25:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 88344 states and 354077 transitions. [2019-12-27 01:25:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:25:32,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:32,138 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-27 01:25:32,138 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1502910472, now seen corresponding path program 2 times [2019-12-27 01:25:32,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:32,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875539211] [2019-12-27 01:25:32,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:32,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875539211] [2019-12-27 01:25:32,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:32,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:32,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899224779] [2019-12-27 01:25:32,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:32,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:32,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:32,230 INFO L87 Difference]: Start difference. First operand 88344 states and 354077 transitions. Second operand 3 states. [2019-12-27 01:25:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:32,640 INFO L93 Difference]: Finished difference Result 88344 states and 349177 transitions. [2019-12-27 01:25:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:32,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 01:25:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:33,605 INFO L225 Difference]: With dead ends: 88344 [2019-12-27 01:25:33,605 INFO L226 Difference]: Without dead ends: 88344 [2019-12-27 01:25:33,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88344 states. [2019-12-27 01:25:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88344 to 88184. [2019-12-27 01:25:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88184 states. [2019-12-27 01:25:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88184 states to 88184 states and 348673 transitions. [2019-12-27 01:25:39,782 INFO L78 Accepts]: Start accepts. Automaton has 88184 states and 348673 transitions. Word has length 33 [2019-12-27 01:25:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:39,782 INFO L462 AbstractCegarLoop]: Abstraction has 88184 states and 348673 transitions. [2019-12-27 01:25:39,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 88184 states and 348673 transitions. [2019-12-27 01:25:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:25:39,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:39,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:39,905 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2074469443, now seen corresponding path program 1 times [2019-12-27 01:25:39,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:39,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867812248] [2019-12-27 01:25:39,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:40,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867812248] [2019-12-27 01:25:40,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:40,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:25:40,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48089959] [2019-12-27 01:25:40,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:25:40,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:40,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:25:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:25:40,022 INFO L87 Difference]: Start difference. First operand 88184 states and 348673 transitions. Second operand 8 states. [2019-12-27 01:25:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:42,621 INFO L93 Difference]: Finished difference Result 160728 states and 633413 transitions. [2019-12-27 01:25:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:25:42,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 01:25:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:43,035 INFO L225 Difference]: With dead ends: 160728 [2019-12-27 01:25:43,035 INFO L226 Difference]: Without dead ends: 148980 [2019-12-27 01:25:43,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:25:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148980 states. [2019-12-27 01:25:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148980 to 102110. [2019-12-27 01:25:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102110 states. [2019-12-27 01:25:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102110 states to 102110 states and 404240 transitions. [2019-12-27 01:25:49,846 INFO L78 Accepts]: Start accepts. Automaton has 102110 states and 404240 transitions. Word has length 34 [2019-12-27 01:25:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:49,846 INFO L462 AbstractCegarLoop]: Abstraction has 102110 states and 404240 transitions. [2019-12-27 01:25:49,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:25:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 102110 states and 404240 transitions. [2019-12-27 01:25:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:25:49,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:49,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:49,952 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1549259149, now seen corresponding path program 2 times [2019-12-27 01:25:49,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:49,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599360160] [2019-12-27 01:25:49,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:50,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599360160] [2019-12-27 01:25:50,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:50,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:25:50,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681386412] [2019-12-27 01:25:50,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:25:50,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:25:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:25:50,124 INFO L87 Difference]: Start difference. First operand 102110 states and 404240 transitions. Second operand 9 states. [2019-12-27 01:25:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:52,105 INFO L93 Difference]: Finished difference Result 181418 states and 726344 transitions. [2019-12-27 01:25:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:25:52,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 01:25:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:52,540 INFO L225 Difference]: With dead ends: 181418 [2019-12-27 01:25:52,540 INFO L226 Difference]: Without dead ends: 172978 [2019-12-27 01:25:52,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:25:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172978 states. [2019-12-27 01:26:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172978 to 99360. [2019-12-27 01:26:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99360 states. [2019-12-27 01:26:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99360 states to 99360 states and 392833 transitions. [2019-12-27 01:26:00,753 INFO L78 Accepts]: Start accepts. Automaton has 99360 states and 392833 transitions. Word has length 34 [2019-12-27 01:26:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:00,753 INFO L462 AbstractCegarLoop]: Abstraction has 99360 states and 392833 transitions. [2019-12-27 01:26:00,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:26:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 99360 states and 392833 transitions. [2019-12-27 01:26:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:26:00,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:00,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:00,858 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash -159612891, now seen corresponding path program 3 times [2019-12-27 01:26:00,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:00,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104109142] [2019-12-27 01:26:00,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:00,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104109142] [2019-12-27 01:26:00,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:00,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:26:00,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711664237] [2019-12-27 01:26:00,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:26:00,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:26:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:26:00,945 INFO L87 Difference]: Start difference. First operand 99360 states and 392833 transitions. Second operand 8 states. [2019-12-27 01:26:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:03,425 INFO L93 Difference]: Finished difference Result 179418 states and 704072 transitions. [2019-12-27 01:26:03,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:26:03,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 01:26:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:03,869 INFO L225 Difference]: With dead ends: 179418 [2019-12-27 01:26:03,870 INFO L226 Difference]: Without dead ends: 163872 [2019-12-27 01:26:03,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:26:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163872 states. [2019-12-27 01:26:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163872 to 109746. [2019-12-27 01:26:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109746 states. [2019-12-27 01:26:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109746 states to 109746 states and 432148 transitions. [2019-12-27 01:26:14,194 INFO L78 Accepts]: Start accepts. Automaton has 109746 states and 432148 transitions. Word has length 34 [2019-12-27 01:26:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:14,195 INFO L462 AbstractCegarLoop]: Abstraction has 109746 states and 432148 transitions. [2019-12-27 01:26:14,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:26:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 109746 states and 432148 transitions. [2019-12-27 01:26:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 01:26:14,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:14,325 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] [2019-12-27 01:26:14,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1678044832, now seen corresponding path program 1 times [2019-12-27 01:26:14,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:14,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927172408] [2019-12-27 01:26:14,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:14,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927172408] [2019-12-27 01:26:14,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:14,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:14,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709119188] [2019-12-27 01:26:14,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:26:14,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:14,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:26:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:26:14,391 INFO L87 Difference]: Start difference. First operand 109746 states and 432148 transitions. Second operand 4 states. [2019-12-27 01:26:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:14,653 INFO L93 Difference]: Finished difference Result 65373 states and 225729 transitions. [2019-12-27 01:26:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:26:14,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 01:26:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:14,763 INFO L225 Difference]: With dead ends: 65373 [2019-12-27 01:26:14,763 INFO L226 Difference]: Without dead ends: 59385 [2019-12-27 01:26:14,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59385 states. [2019-12-27 01:26:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59385 to 59385. [2019-12-27 01:26:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59385 states. [2019-12-27 01:26:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59385 states to 59385 states and 204361 transitions. [2019-12-27 01:26:16,329 INFO L78 Accepts]: Start accepts. Automaton has 59385 states and 204361 transitions. Word has length 35 [2019-12-27 01:26:16,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:16,329 INFO L462 AbstractCegarLoop]: Abstraction has 59385 states and 204361 transitions. [2019-12-27 01:26:16,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:26:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 59385 states and 204361 transitions. [2019-12-27 01:26:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 01:26:16,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:16,392 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] [2019-12-27 01:26:16,392 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:16,392 INFO L82 PathProgramCache]: Analyzing trace with hash -88707831, now seen corresponding path program 1 times [2019-12-27 01:26:16,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:16,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225051578] [2019-12-27 01:26:16,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:16,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225051578] [2019-12-27 01:26:16,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:16,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:16,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769491401] [2019-12-27 01:26:16,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:26:16,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:16,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:26:16,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:26:16,467 INFO L87 Difference]: Start difference. First operand 59385 states and 204361 transitions. Second operand 4 states. [2019-12-27 01:26:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:16,967 INFO L93 Difference]: Finished difference Result 112135 states and 386125 transitions. [2019-12-27 01:26:16,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:26:16,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-27 01:26:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:17,092 INFO L225 Difference]: With dead ends: 112135 [2019-12-27 01:26:17,093 INFO L226 Difference]: Without dead ends: 59442 [2019-12-27 01:26:17,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59442 states. [2019-12-27 01:26:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59442 to 59385. [2019-12-27 01:26:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59385 states. [2019-12-27 01:26:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59385 states to 59385 states and 199995 transitions. [2019-12-27 01:26:18,926 INFO L78 Accepts]: Start accepts. Automaton has 59385 states and 199995 transitions. Word has length 36 [2019-12-27 01:26:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:18,927 INFO L462 AbstractCegarLoop]: Abstraction has 59385 states and 199995 transitions. [2019-12-27 01:26:18,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:26:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59385 states and 199995 transitions. [2019-12-27 01:26:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 01:26:18,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:18,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:18,982 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:18,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1358646705, now seen corresponding path program 2 times [2019-12-27 01:26:18,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:18,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925319070] [2019-12-27 01:26:18,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:19,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925319070] [2019-12-27 01:26:19,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:19,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:26:19,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226412262] [2019-12-27 01:26:19,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:26:19,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:26:19,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:19,059 INFO L87 Difference]: Start difference. First operand 59385 states and 199995 transitions. Second operand 5 states. [2019-12-27 01:26:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:19,154 INFO L93 Difference]: Finished difference Result 10691 states and 30074 transitions. [2019-12-27 01:26:19,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:26:19,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-27 01:26:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:19,170 INFO L225 Difference]: With dead ends: 10691 [2019-12-27 01:26:19,170 INFO L226 Difference]: Without dead ends: 7572 [2019-12-27 01:26:19,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:26:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7572 states. [2019-12-27 01:26:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7572 to 7560. [2019-12-27 01:26:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2019-12-27 01:26:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 19149 transitions. [2019-12-27 01:26:19,307 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 19149 transitions. Word has length 36 [2019-12-27 01:26:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:19,309 INFO L462 AbstractCegarLoop]: Abstraction has 7560 states and 19149 transitions. [2019-12-27 01:26:19,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:26:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 19149 transitions. [2019-12-27 01:26:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 01:26:19,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:19,320 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] [2019-12-27 01:26:19,320 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash -244656218, now seen corresponding path program 1 times [2019-12-27 01:26:19,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:19,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488409480] [2019-12-27 01:26:19,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:19,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488409480] [2019-12-27 01:26:19,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:19,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:26:19,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327736506] [2019-12-27 01:26:19,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:26:19,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:19,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:26:19,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:26:19,428 INFO L87 Difference]: Start difference. First operand 7560 states and 19149 transitions. Second operand 6 states. [2019-12-27 01:26:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:19,507 INFO L93 Difference]: Finished difference Result 6222 states and 16086 transitions. [2019-12-27 01:26:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:26:19,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 01:26:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:19,512 INFO L225 Difference]: With dead ends: 6222 [2019-12-27 01:26:19,512 INFO L226 Difference]: Without dead ends: 3138 [2019-12-27 01:26:19,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2019-12-27 01:26:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3126. [2019-12-27 01:26:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2019-12-27 01:26:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 8037 transitions. [2019-12-27 01:26:19,563 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 8037 transitions. Word has length 47 [2019-12-27 01:26:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:19,563 INFO L462 AbstractCegarLoop]: Abstraction has 3126 states and 8037 transitions. [2019-12-27 01:26:19,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:26:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 8037 transitions. [2019-12-27 01:26:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 01:26:19,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:19,568 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] [2019-12-27 01:26:19,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:19,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1360412447, now seen corresponding path program 1 times [2019-12-27 01:26:19,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:19,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829680088] [2019-12-27 01:26:19,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:19,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829680088] [2019-12-27 01:26:19,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:19,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:26:19,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555150703] [2019-12-27 01:26:19,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:26:19,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:19,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:26:19,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:26:19,669 INFO L87 Difference]: Start difference. First operand 3126 states and 8037 transitions. Second operand 6 states. [2019-12-27 01:26:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:19,883 INFO L93 Difference]: Finished difference Result 5397 states and 13758 transitions. [2019-12-27 01:26:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:26:19,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 01:26:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:19,890 INFO L225 Difference]: With dead ends: 5397 [2019-12-27 01:26:19,890 INFO L226 Difference]: Without dead ends: 4828 [2019-12-27 01:26:19,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:26:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-12-27 01:26:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 3583. [2019-12-27 01:26:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-12-27 01:26:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 9162 transitions. [2019-12-27 01:26:19,933 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 9162 transitions. Word has length 62 [2019-12-27 01:26:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:19,934 INFO L462 AbstractCegarLoop]: Abstraction has 3583 states and 9162 transitions. [2019-12-27 01:26:19,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:26:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 9162 transitions. [2019-12-27 01:26:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 01:26:19,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:19,937 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] [2019-12-27 01:26:19,937 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1807325087, now seen corresponding path program 2 times [2019-12-27 01:26:19,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:19,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358272225] [2019-12-27 01:26:19,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:20,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358272225] [2019-12-27 01:26:20,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:20,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:20,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300309826] [2019-12-27 01:26:20,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:26:20,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:20,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:26:20,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:26:20,007 INFO L87 Difference]: Start difference. First operand 3583 states and 9162 transitions. Second operand 4 states. [2019-12-27 01:26:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:20,032 INFO L93 Difference]: Finished difference Result 3957 states and 10020 transitions. [2019-12-27 01:26:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:26:20,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-27 01:26:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:20,033 INFO L225 Difference]: With dead ends: 3957 [2019-12-27 01:26:20,034 INFO L226 Difference]: Without dead ends: 426 [2019-12-27 01:26:20,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-27 01:26:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-12-27 01:26:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-27 01:26:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 933 transitions. [2019-12-27 01:26:20,040 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 933 transitions. Word has length 62 [2019-12-27 01:26:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:20,040 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 933 transitions. [2019-12-27 01:26:20,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:26:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 933 transitions. [2019-12-27 01:26:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:26:20,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:20,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:20,041 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:20,041 INFO L82 PathProgramCache]: Analyzing trace with hash 742159584, now seen corresponding path program 1 times [2019-12-27 01:26:20,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:20,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812521322] [2019-12-27 01:26:20,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:20,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812521322] [2019-12-27 01:26:20,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:20,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:26:20,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082938296] [2019-12-27 01:26:20,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:26:20,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:26:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:26:20,138 INFO L87 Difference]: Start difference. First operand 426 states and 933 transitions. Second operand 8 states. [2019-12-27 01:26:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:20,413 INFO L93 Difference]: Finished difference Result 912 states and 1964 transitions. [2019-12-27 01:26:20,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:26:20,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:26:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:20,415 INFO L225 Difference]: With dead ends: 912 [2019-12-27 01:26:20,415 INFO L226 Difference]: Without dead ends: 661 [2019-12-27 01:26:20,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:26:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-12-27 01:26:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 515. [2019-12-27 01:26:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-12-27 01:26:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1093 transitions. [2019-12-27 01:26:20,424 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1093 transitions. Word has length 63 [2019-12-27 01:26:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:20,424 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 1093 transitions. [2019-12-27 01:26:20,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:26:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1093 transitions. [2019-12-27 01:26:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:26:20,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:20,427 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] [2019-12-27 01:26:20,427 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash -250797522, now seen corresponding path program 2 times [2019-12-27 01:26:20,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:20,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842539229] [2019-12-27 01:26:20,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:26:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:26:20,643 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:26:20,644 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:26:20,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= 0 v_~__unbuffered_p0_EAX~0_101) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= v_~__unbuffered_cnt~0_161 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_119|) |v_ULTIMATE.start_main_~#t272~0.offset_66| 0)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t272~0.base_119| 4)) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t272~0.base_119|) 0) (= 0 |v_ULTIMATE.start_main_~#t272~0.offset_66|) (= 0 v_~__unbuffered_p1_EBX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t272~0.base_119| 1) |v_#valid_150|) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_453 0) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t272~0.base_119|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_91|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ULTIMATE.start_main_~#t272~0.base=|v_ULTIMATE.start_main_~#t272~0.base_119|, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_39|, ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_66|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_~#t272~0.offset=|v_ULTIMATE.start_main_~#t272~0.offset_66|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t273~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t273~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t272~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t274~0.offset, ULTIMATE.start_main_~#t274~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t272~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:26:20,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t273~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t273~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t273~0.base_11| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t273~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11|) |v_ULTIMATE.start_main_~#t273~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t273~0.offset, #length, ULTIMATE.start_main_~#t273~0.base] because there is no mapped edge [2019-12-27 01:26:20,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t274~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t274~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t274~0.offset_8|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) |v_ULTIMATE.start_main_~#t274~0.offset_8| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t274~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t274~0.offset] because there is no mapped edge [2019-12-27 01:26:20,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_193 256)) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_67) (= v_~z$w_buff0~0_154 1) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 01:26:20,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-768050764 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-768050764 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-768050764| ~z$w_buff1~0_In-768050764) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-768050764| ~z$w_buff0~0_In-768050764)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-768050764, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-768050764, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-768050764, ~z$w_buff1~0=~z$w_buff1~0_In-768050764} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-768050764|, ~z$w_buff0~0=~z$w_buff0~0_In-768050764, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-768050764, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-768050764, ~z$w_buff1~0=~z$w_buff1~0_In-768050764} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 01:26:20,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_29, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:26:20,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:26:20,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-271883976 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-271883976| ~z~0_In-271883976) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-271883976| ~z$mem_tmp~0_In-271883976) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-271883976, ~z$flush_delayed~0=~z$flush_delayed~0_In-271883976, ~z~0=~z~0_In-271883976} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-271883976|, ~z$mem_tmp~0=~z$mem_tmp~0_In-271883976, ~z$flush_delayed~0=~z$flush_delayed~0_In-271883976, ~z~0=~z~0_In-271883976} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 01:26:20,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:26:20,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In737370295 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In737370295 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out737370295| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out737370295| ~z$w_buff0_used~0_In737370295)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In737370295, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In737370295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In737370295, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In737370295, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out737370295|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 01:26:20,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1826648635 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1826648635 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1826648635 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1826648635 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out-1826648635| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-1826648635| ~z$w_buff1_used~0_In-1826648635) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1826648635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1826648635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1826648635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1826648635} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1826648635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1826648635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1826648635, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1826648635|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1826648635} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 01:26:20,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1406294498 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1406294498 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out1406294498)) (and (= ~z$r_buff0_thd3~0_In1406294498 ~z$r_buff0_thd3~0_Out1406294498) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1406294498, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1406294498} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1406294498, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1406294498, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1406294498|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 01:26:20,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1169654920 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1169654920 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1169654920 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1169654920 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out-1169654920| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite54_Out-1169654920| ~z$r_buff1_thd3~0_In-1169654920)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169654920, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1169654920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1169654920, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1169654920} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169654920, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1169654920|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1169654920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1169654920, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1169654920} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 01:26:20,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_42|) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:26:20,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In548696112 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In548696112 |P1Thread1of1ForFork2_#t~ite25_Out548696112|)) (and .cse0 (= ~z~0_In548696112 |P1Thread1of1ForFork2_#t~ite25_Out548696112|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In548696112, ~z$flush_delayed~0=~z$flush_delayed~0_In548696112, ~z~0=~z~0_In548696112} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In548696112, ~z$flush_delayed~0=~z$flush_delayed~0_In548696112, ~z~0=~z~0_In548696112, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out548696112|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 01:26:20,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 01:26:20,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 01:26:20,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-908799705| |ULTIMATE.start_main_#t~ite58_Out-908799705|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-908799705 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-908799705 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-908799705 |ULTIMATE.start_main_#t~ite58_Out-908799705|)) (and .cse0 (= ~z~0_In-908799705 |ULTIMATE.start_main_#t~ite58_Out-908799705|) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-908799705, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908799705, ~z$w_buff1~0=~z$w_buff1~0_In-908799705, ~z~0=~z~0_In-908799705} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-908799705, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-908799705|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908799705, ~z$w_buff1~0=~z$w_buff1~0_In-908799705, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-908799705|, ~z~0=~z~0_In-908799705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 01:26:20,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1472608315 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1472608315 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1472608315|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1472608315 |ULTIMATE.start_main_#t~ite60_Out-1472608315|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1472608315, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1472608315} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1472608315|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1472608315, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1472608315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 01:26:20,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In367721984 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In367721984 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In367721984 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In367721984 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In367721984 |ULTIMATE.start_main_#t~ite61_Out367721984|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite61_Out367721984|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In367721984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In367721984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In367721984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In367721984} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In367721984, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out367721984|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In367721984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In367721984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In367721984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 01:26:20,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In143021370 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In143021370 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out143021370|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In143021370 |ULTIMATE.start_main_#t~ite62_Out143021370|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In143021370, ~z$w_buff0_used~0=~z$w_buff0_used~0_In143021370} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out143021370|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In143021370, ~z$w_buff0_used~0=~z$w_buff0_used~0_In143021370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 01:26:20,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1919525419 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1919525419 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1919525419 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1919525419 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1919525419| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1919525419| ~z$r_buff1_thd0~0_In-1919525419) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1919525419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1919525419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1919525419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1919525419} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1919525419|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1919525419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1919525419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1919525419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1919525419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 01:26:20,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_33 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= 1 v_~__unbuffered_p1_EAX~0_52) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:26:20,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:26:20 BasicIcfg [2019-12-27 01:26:20,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:26:20,914 INFO L168 Benchmark]: Toolchain (without parser) took 94654.61 ms. Allocated memory was 136.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:26:20,922 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:26:20,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.20 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 151.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:20,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.58 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:20,927 INFO L168 Benchmark]: Boogie Preprocessor took 40.87 ms. Allocated memory is still 200.8 MB. Free memory was 148.5 MB in the beginning and 145.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:20,927 INFO L168 Benchmark]: RCFGBuilder took 1041.59 ms. Allocated memory is still 200.8 MB. Free memory was 145.7 MB in the beginning and 89.7 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:26:20,928 INFO L168 Benchmark]: TraceAbstraction took 92755.58 ms. Allocated memory was 200.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 89.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 01:26:20,938 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.20 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 151.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.58 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.87 ms. Allocated memory is still 200.8 MB. Free memory was 148.5 MB in the beginning and 145.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1041.59 ms. Allocated memory is still 200.8 MB. Free memory was 145.7 MB in the beginning and 89.7 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92755.58 ms. Allocated memory was 200.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 89.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 129 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 28 ChoiceCompositions, 9334 VarBasedMoverChecksPositive, 325 VarBasedMoverChecksNegative, 95 SemBasedMoverChecksPositive, 334 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 138188 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t272, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t273, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t274, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4186 SDtfs, 6364 SDslu, 9961 SDs, 0 SdLazy, 2721 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109746occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 200112 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 74166 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...