/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:53:38,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:53:38,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:53:38,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:53:38,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:53:38,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:53:38,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:53:38,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:53:38,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:53:38,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:53:38,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:53:38,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:53:38,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:53:38,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:53:38,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:53:38,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:53:38,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:53:38,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:53:38,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:53:38,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:53:38,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:53:38,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:53:38,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:53:38,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:53:38,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:53:38,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:53:38,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:53:38,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:53:38,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:53:38,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:53:38,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:53:38,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:53:38,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:53:38,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:53:38,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:53:38,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:53:38,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:53:38,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:53:38,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:53:38,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:53:38,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:53:38,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 19:53:38,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:53:38,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:53:38,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:53:38,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:53:38,177 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:53:38,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:53:38,178 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:53:38,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:53:38,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:53:38,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:53:38,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:53:38,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:53:38,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:53:38,179 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:53:38,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:53:38,179 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:53:38,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:53:38,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:53:38,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:53:38,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:53:38,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:53:38,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:53:38,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:53:38,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:53:38,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:53:38,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:53:38,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:53:38,184 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:53:38,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:53:38,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:53:38,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:53:38,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:53:38,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:53:38,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:53:38,456 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:53:38,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-18 19:53:38,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337a34fcf/3df2647d149f45e0aa6a3616a93e235a/FLAG97e5eb0c2 [2019-12-18 19:53:39,083 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:53:39,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-18 19:53:39,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337a34fcf/3df2647d149f45e0aa6a3616a93e235a/FLAG97e5eb0c2 [2019-12-18 19:53:39,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337a34fcf/3df2647d149f45e0aa6a3616a93e235a [2019-12-18 19:53:39,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:53:39,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:53:39,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:53:39,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:53:39,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:53:39,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:53:39" (1/1) ... [2019-12-18 19:53:39,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7374da13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:39, skipping insertion in model container [2019-12-18 19:53:39,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:53:39" (1/1) ... [2019-12-18 19:53:39,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:53:39,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:53:39,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:53:40,007 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:53:40,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:53:40,158 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:53:40,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40 WrapperNode [2019-12-18 19:53:40,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:53:40,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:53:40,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:53:40,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:53:40,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:53:40,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:53:40,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:53:40,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:53:40,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... [2019-12-18 19:53:40,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:53:40,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:53:40,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:53:40,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:53:40,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:53:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:53:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:53:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:53:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:53:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:53:40,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:53:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:53:40,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:53:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:53:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:53:40,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:53:40,361 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:53:41,344 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:53:41,344 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:53:41,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:53:41 BoogieIcfgContainer [2019-12-18 19:53:41,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:53:41,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:53:41,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:53:41,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:53:41,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:53:39" (1/3) ... [2019-12-18 19:53:41,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc1c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:53:41, skipping insertion in model container [2019-12-18 19:53:41,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:53:40" (2/3) ... [2019-12-18 19:53:41,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc1c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:53:41, skipping insertion in model container [2019-12-18 19:53:41,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:53:41" (3/3) ... [2019-12-18 19:53:41,354 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.oepc.i [2019-12-18 19:53:41,365 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:53:41,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:53:41,388 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:53:41,389 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:53:41,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,431 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,431 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,458 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,458 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,487 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:53:41,522 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:53:41,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:53:41,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:53:41,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:53:41,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:53:41,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:53:41,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:53:41,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:53:41,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:53:41,571 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-18 19:53:41,573 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-18 19:53:41,698 INFO L126 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-18 19:53:41,698 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:53:41,724 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 19:53:41,760 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-18 19:53:41,820 INFO L126 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-18 19:53:41,820 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:53:41,831 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 19:53:41,867 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-18 19:53:41,868 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:53:45,259 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 19:53:45,392 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 19:53:45,442 INFO L206 etLargeBlockEncoding]: Checked pairs total: 156567 [2019-12-18 19:53:45,442 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 19:53:45,446 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 141 transitions [2019-12-18 19:53:47,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 31650 states. [2019-12-18 19:53:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 31650 states. [2019-12-18 19:53:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:53:47,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:47,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:53:47,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1078912, now seen corresponding path program 1 times [2019-12-18 19:53:47,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:47,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015490611] [2019-12-18 19:53:47,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:47,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015490611] [2019-12-18 19:53:47,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:47,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:53:47,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675488343] [2019-12-18 19:53:47,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:53:47,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:53:47,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:47,774 INFO L87 Difference]: Start difference. First operand 31650 states. Second operand 3 states. [2019-12-18 19:53:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:48,331 INFO L93 Difference]: Finished difference Result 31498 states and 111612 transitions. [2019-12-18 19:53:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:53:48,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:53:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:48,645 INFO L225 Difference]: With dead ends: 31498 [2019-12-18 19:53:48,646 INFO L226 Difference]: Without dead ends: 29342 [2019-12-18 19:53:48,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29342 states. [2019-12-18 19:53:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29342 to 29342. [2019-12-18 19:53:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29342 states. [2019-12-18 19:53:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29342 states to 29342 states and 103886 transitions. [2019-12-18 19:53:51,455 INFO L78 Accepts]: Start accepts. Automaton has 29342 states and 103886 transitions. Word has length 3 [2019-12-18 19:53:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:51,456 INFO L462 AbstractCegarLoop]: Abstraction has 29342 states and 103886 transitions. [2019-12-18 19:53:51,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:53:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29342 states and 103886 transitions. [2019-12-18 19:53:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:53:51,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:51,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:51,460 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 559991540, now seen corresponding path program 1 times [2019-12-18 19:53:51,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:51,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949334853] [2019-12-18 19:53:51,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:51,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949334853] [2019-12-18 19:53:51,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:51,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:53:51,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356741416] [2019-12-18 19:53:51,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:53:51,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:53:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:51,545 INFO L87 Difference]: Start difference. First operand 29342 states and 103886 transitions. Second operand 3 states. [2019-12-18 19:53:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:51,649 INFO L93 Difference]: Finished difference Result 3451 states and 8567 transitions. [2019-12-18 19:53:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:53:51,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 19:53:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:51,659 INFO L225 Difference]: With dead ends: 3451 [2019-12-18 19:53:51,660 INFO L226 Difference]: Without dead ends: 3451 [2019-12-18 19:53:51,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2019-12-18 19:53:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2019-12-18 19:53:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-12-18 19:53:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 8567 transitions. [2019-12-18 19:53:51,781 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 8567 transitions. Word has length 11 [2019-12-18 19:53:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:51,781 INFO L462 AbstractCegarLoop]: Abstraction has 3451 states and 8567 transitions. [2019-12-18 19:53:51,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:53:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 8567 transitions. [2019-12-18 19:53:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:53:51,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:51,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:51,791 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1482577634, now seen corresponding path program 1 times [2019-12-18 19:53:51,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:51,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100285983] [2019-12-18 19:53:51,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:51,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100285983] [2019-12-18 19:53:51,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:51,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:53:51,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783302680] [2019-12-18 19:53:51,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:53:51,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:53:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:53:51,972 INFO L87 Difference]: Start difference. First operand 3451 states and 8567 transitions. Second operand 4 states. [2019-12-18 19:53:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:52,380 INFO L93 Difference]: Finished difference Result 4533 states and 11006 transitions. [2019-12-18 19:53:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:53:52,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 19:53:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:52,394 INFO L225 Difference]: With dead ends: 4533 [2019-12-18 19:53:52,395 INFO L226 Difference]: Without dead ends: 4533 [2019-12-18 19:53:52,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:53:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-12-18 19:53:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4465. [2019-12-18 19:53:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-12-18 19:53:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 10874 transitions. [2019-12-18 19:53:52,600 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 10874 transitions. Word has length 14 [2019-12-18 19:53:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:52,600 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 10874 transitions. [2019-12-18 19:53:52,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:53:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 10874 transitions. [2019-12-18 19:53:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:53:52,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:52,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:52,602 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1284762389, now seen corresponding path program 1 times [2019-12-18 19:53:52,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:52,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988783330] [2019-12-18 19:53:52,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:52,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988783330] [2019-12-18 19:53:52,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:52,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:53:52,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929613612] [2019-12-18 19:53:52,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:53:52,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:53:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:52,669 INFO L87 Difference]: Start difference. First operand 4465 states and 10874 transitions. Second operand 3 states. [2019-12-18 19:53:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:52,761 INFO L93 Difference]: Finished difference Result 7903 states and 18336 transitions. [2019-12-18 19:53:52,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:53:52,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 19:53:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:52,781 INFO L225 Difference]: With dead ends: 7903 [2019-12-18 19:53:52,781 INFO L226 Difference]: Without dead ends: 7903 [2019-12-18 19:53:52,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2019-12-18 19:53:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 6842. [2019-12-18 19:53:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2019-12-18 19:53:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 16113 transitions. [2019-12-18 19:53:52,929 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 16113 transitions. Word has length 15 [2019-12-18 19:53:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:52,929 INFO L462 AbstractCegarLoop]: Abstraction has 6842 states and 16113 transitions. [2019-12-18 19:53:52,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:53:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 16113 transitions. [2019-12-18 19:53:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:53:52,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:52,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:52,931 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1823214846, now seen corresponding path program 1 times [2019-12-18 19:53:52,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:52,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233200085] [2019-12-18 19:53:52,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:52,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233200085] [2019-12-18 19:53:52,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:52,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:53:52,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120159026] [2019-12-18 19:53:52,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:53:52,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:53:52,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:53:52,995 INFO L87 Difference]: Start difference. First operand 6842 states and 16113 transitions. Second operand 4 states. [2019-12-18 19:53:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:53,329 INFO L93 Difference]: Finished difference Result 8322 states and 19313 transitions. [2019-12-18 19:53:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:53:53,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 19:53:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:53,349 INFO L225 Difference]: With dead ends: 8322 [2019-12-18 19:53:53,349 INFO L226 Difference]: Without dead ends: 8322 [2019-12-18 19:53:53,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:53:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-18 19:53:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 6895. [2019-12-18 19:53:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6895 states. [2019-12-18 19:53:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 16226 transitions. [2019-12-18 19:53:53,508 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 16226 transitions. Word has length 17 [2019-12-18 19:53:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:53,509 INFO L462 AbstractCegarLoop]: Abstraction has 6895 states and 16226 transitions. [2019-12-18 19:53:53,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:53:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 16226 transitions. [2019-12-18 19:53:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:53:53,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:53,515 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] [2019-12-18 19:53:53,515 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1246091973, now seen corresponding path program 1 times [2019-12-18 19:53:53,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:53,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519726176] [2019-12-18 19:53:53,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:53,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519726176] [2019-12-18 19:53:53,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:53,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:53:53,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648602669] [2019-12-18 19:53:53,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:53:53,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:53,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:53:53,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:53:53,662 INFO L87 Difference]: Start difference. First operand 6895 states and 16226 transitions. Second operand 5 states. [2019-12-18 19:53:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:54,231 INFO L93 Difference]: Finished difference Result 9279 states and 21293 transitions. [2019-12-18 19:53:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:53:54,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 19:53:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:54,251 INFO L225 Difference]: With dead ends: 9279 [2019-12-18 19:53:54,252 INFO L226 Difference]: Without dead ends: 9279 [2019-12-18 19:53:54,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:53:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2019-12-18 19:53:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 8842. [2019-12-18 19:53:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8842 states. [2019-12-18 19:53:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8842 states to 8842 states and 20427 transitions. [2019-12-18 19:53:54,411 INFO L78 Accepts]: Start accepts. Automaton has 8842 states and 20427 transitions. Word has length 27 [2019-12-18 19:53:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:54,412 INFO L462 AbstractCegarLoop]: Abstraction has 8842 states and 20427 transitions. [2019-12-18 19:53:54,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:53:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 20427 transitions. [2019-12-18 19:53:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:53:54,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:54,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:54,422 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -326843675, now seen corresponding path program 1 times [2019-12-18 19:53:54,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:54,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332770529] [2019-12-18 19:53:54,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:54,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332770529] [2019-12-18 19:53:54,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:54,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:53:54,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249439043] [2019-12-18 19:53:54,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:53:54,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:53:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:54,492 INFO L87 Difference]: Start difference. First operand 8842 states and 20427 transitions. Second operand 3 states. [2019-12-18 19:53:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:54,575 INFO L93 Difference]: Finished difference Result 9983 states and 21907 transitions. [2019-12-18 19:53:54,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:53:54,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 19:53:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:54,597 INFO L225 Difference]: With dead ends: 9983 [2019-12-18 19:53:54,597 INFO L226 Difference]: Without dead ends: 9983 [2019-12-18 19:53:54,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-12-18 19:53:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 8811. [2019-12-18 19:53:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-18 19:53:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 19466 transitions. [2019-12-18 19:53:54,784 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 19466 transitions. Word has length 30 [2019-12-18 19:53:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:54,784 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 19466 transitions. [2019-12-18 19:53:54,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:53:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 19466 transitions. [2019-12-18 19:53:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 19:53:54,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:54,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:54,794 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1451833890, now seen corresponding path program 1 times [2019-12-18 19:53:54,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:54,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626997736] [2019-12-18 19:53:54,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:54,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626997736] [2019-12-18 19:53:54,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:54,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:53:54,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833493534] [2019-12-18 19:53:54,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:53:54,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:54,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:53:54,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:53:54,883 INFO L87 Difference]: Start difference. First operand 8811 states and 19466 transitions. Second operand 5 states. [2019-12-18 19:53:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:55,382 INFO L93 Difference]: Finished difference Result 9934 states and 21689 transitions. [2019-12-18 19:53:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:53:55,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 19:53:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:55,396 INFO L225 Difference]: With dead ends: 9934 [2019-12-18 19:53:55,396 INFO L226 Difference]: Without dead ends: 9934 [2019-12-18 19:53:55,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:53:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9934 states. [2019-12-18 19:53:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9934 to 7897. [2019-12-18 19:53:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-18 19:53:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 17615 transitions. [2019-12-18 19:53:55,578 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 17615 transitions. Word has length 33 [2019-12-18 19:53:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:55,578 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 17615 transitions. [2019-12-18 19:53:55,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:53:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 17615 transitions. [2019-12-18 19:53:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 19:53:55,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:55,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:55,592 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1521082095, now seen corresponding path program 1 times [2019-12-18 19:53:55,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:55,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990856419] [2019-12-18 19:53:55,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:55,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990856419] [2019-12-18 19:53:55,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:55,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:53:55,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810774272] [2019-12-18 19:53:55,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:53:55,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:55,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:53:55,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:53:55,653 INFO L87 Difference]: Start difference. First operand 7897 states and 17615 transitions. Second operand 4 states. [2019-12-18 19:53:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:55,684 INFO L93 Difference]: Finished difference Result 5532 states and 12270 transitions. [2019-12-18 19:53:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:53:55,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 19:53:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:55,693 INFO L225 Difference]: With dead ends: 5532 [2019-12-18 19:53:55,693 INFO L226 Difference]: Without dead ends: 5532 [2019-12-18 19:53:55,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:53:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-12-18 19:53:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5428. [2019-12-18 19:53:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2019-12-18 19:53:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 12077 transitions. [2019-12-18 19:53:55,894 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 12077 transitions. Word has length 39 [2019-12-18 19:53:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:55,894 INFO L462 AbstractCegarLoop]: Abstraction has 5428 states and 12077 transitions. [2019-12-18 19:53:55,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:53:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 12077 transitions. [2019-12-18 19:53:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 19:53:55,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:55,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -180233684, now seen corresponding path program 1 times [2019-12-18 19:53:55,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:55,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290504222] [2019-12-18 19:53:55,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:56,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290504222] [2019-12-18 19:53:56,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:56,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:53:56,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005798085] [2019-12-18 19:53:56,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:53:56,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:53:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:53:56,030 INFO L87 Difference]: Start difference. First operand 5428 states and 12077 transitions. Second operand 8 states. [2019-12-18 19:53:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:56,545 INFO L93 Difference]: Finished difference Result 10275 states and 22585 transitions. [2019-12-18 19:53:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:53:56,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-18 19:53:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:56,555 INFO L225 Difference]: With dead ends: 10275 [2019-12-18 19:53:56,555 INFO L226 Difference]: Without dead ends: 9146 [2019-12-18 19:53:56,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:53:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9146 states. [2019-12-18 19:53:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9146 to 6812. [2019-12-18 19:53:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2019-12-18 19:53:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 15382 transitions. [2019-12-18 19:53:56,697 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 15382 transitions. Word has length 68 [2019-12-18 19:53:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:56,698 INFO L462 AbstractCegarLoop]: Abstraction has 6812 states and 15382 transitions. [2019-12-18 19:53:56,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:53:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 15382 transitions. [2019-12-18 19:53:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 19:53:56,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:56,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:56,716 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1054499084, now seen corresponding path program 2 times [2019-12-18 19:53:56,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:56,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325062056] [2019-12-18 19:53:56,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:56,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325062056] [2019-12-18 19:53:56,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:56,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:53:56,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060342678] [2019-12-18 19:53:56,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:53:56,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:56,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:53:56,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:53:56,864 INFO L87 Difference]: Start difference. First operand 6812 states and 15382 transitions. Second operand 5 states. [2019-12-18 19:53:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:57,049 INFO L93 Difference]: Finished difference Result 9900 states and 22320 transitions. [2019-12-18 19:53:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:53:57,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-18 19:53:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:57,065 INFO L225 Difference]: With dead ends: 9900 [2019-12-18 19:53:57,065 INFO L226 Difference]: Without dead ends: 8364 [2019-12-18 19:53:57,066 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-18 19:53:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-12-18 19:53:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8264. [2019-12-18 19:53:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8264 states. [2019-12-18 19:53:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 18802 transitions. [2019-12-18 19:53:57,224 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 18802 transitions. Word has length 68 [2019-12-18 19:53:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:57,225 INFO L462 AbstractCegarLoop]: Abstraction has 8264 states and 18802 transitions. [2019-12-18 19:53:57,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:53:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 18802 transitions. [2019-12-18 19:53:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 19:53:57,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:57,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:57,245 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash 283351324, now seen corresponding path program 3 times [2019-12-18 19:53:57,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:57,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456773009] [2019-12-18 19:53:57,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:57,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456773009] [2019-12-18 19:53:57,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:57,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:53:57,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518456963] [2019-12-18 19:53:57,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:53:57,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:53:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:53:57,400 INFO L87 Difference]: Start difference. First operand 8264 states and 18802 transitions. Second operand 8 states. [2019-12-18 19:53:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:57,893 INFO L93 Difference]: Finished difference Result 12633 states and 28391 transitions. [2019-12-18 19:53:57,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 19:53:57,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-18 19:53:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:57,906 INFO L225 Difference]: With dead ends: 12633 [2019-12-18 19:53:57,906 INFO L226 Difference]: Without dead ends: 12150 [2019-12-18 19:53:57,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:53:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12150 states. [2019-12-18 19:53:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12150 to 8320. [2019-12-18 19:53:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-12-18 19:53:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 18925 transitions. [2019-12-18 19:53:58,089 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 18925 transitions. Word has length 68 [2019-12-18 19:53:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:58,089 INFO L462 AbstractCegarLoop]: Abstraction has 8320 states and 18925 transitions. [2019-12-18 19:53:58,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:53:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 18925 transitions. [2019-12-18 19:53:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 19:53:58,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:58,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:58,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:58,113 INFO L82 PathProgramCache]: Analyzing trace with hash 741146474, now seen corresponding path program 4 times [2019-12-18 19:53:58,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:58,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316470148] [2019-12-18 19:53:58,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:58,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316470148] [2019-12-18 19:53:58,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:58,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:53:58,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588595937] [2019-12-18 19:53:58,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:53:58,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:53:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:53:58,193 INFO L87 Difference]: Start difference. First operand 8320 states and 18925 transitions. Second operand 4 states. [2019-12-18 19:53:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:58,234 INFO L93 Difference]: Finished difference Result 9037 states and 20456 transitions. [2019-12-18 19:53:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:53:58,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-18 19:53:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:58,236 INFO L225 Difference]: With dead ends: 9037 [2019-12-18 19:53:58,236 INFO L226 Difference]: Without dead ends: 909 [2019-12-18 19:53:58,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:53:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-18 19:53:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-12-18 19:53:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-18 19:53:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1891 transitions. [2019-12-18 19:53:58,249 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1891 transitions. Word has length 68 [2019-12-18 19:53:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:58,250 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1891 transitions. [2019-12-18 19:53:58,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:53:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1891 transitions. [2019-12-18 19:53:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 19:53:58,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:58,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:58,253 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1610368982, now seen corresponding path program 1 times [2019-12-18 19:53:58,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:58,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231974245] [2019-12-18 19:53:58,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:58,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231974245] [2019-12-18 19:53:58,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:58,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:53:58,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059066442] [2019-12-18 19:53:58,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:53:58,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:53:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:53:58,355 INFO L87 Difference]: Start difference. First operand 909 states and 1891 transitions. Second operand 5 states. [2019-12-18 19:53:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:58,648 INFO L93 Difference]: Finished difference Result 1025 states and 2099 transitions. [2019-12-18 19:53:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:53:58,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-18 19:53:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:58,650 INFO L225 Difference]: With dead ends: 1025 [2019-12-18 19:53:58,650 INFO L226 Difference]: Without dead ends: 1025 [2019-12-18 19:53:58,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:53:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-12-18 19:53:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 987. [2019-12-18 19:53:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-18 19:53:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2032 transitions. [2019-12-18 19:53:58,669 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2032 transitions. Word has length 69 [2019-12-18 19:53:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:58,670 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 2032 transitions. [2019-12-18 19:53:58,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:53:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2032 transitions. [2019-12-18 19:53:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 19:53:58,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:58,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:58,674 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1863095554, now seen corresponding path program 2 times [2019-12-18 19:53:58,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:58,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417512998] [2019-12-18 19:53:58,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:58,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417512998] [2019-12-18 19:53:58,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:58,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:53:58,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603085945] [2019-12-18 19:53:58,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:53:58,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:53:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:58,846 INFO L87 Difference]: Start difference. First operand 987 states and 2032 transitions. Second operand 3 states. [2019-12-18 19:53:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:58,863 INFO L93 Difference]: Finished difference Result 987 states and 2031 transitions. [2019-12-18 19:53:58,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:53:58,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-18 19:53:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:58,866 INFO L225 Difference]: With dead ends: 987 [2019-12-18 19:53:58,866 INFO L226 Difference]: Without dead ends: 987 [2019-12-18 19:53:58,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:53:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-12-18 19:53:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 918. [2019-12-18 19:53:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-12-18 19:53:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1909 transitions. [2019-12-18 19:53:58,885 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1909 transitions. Word has length 69 [2019-12-18 19:53:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:58,885 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1909 transitions. [2019-12-18 19:53:58,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:53:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1909 transitions. [2019-12-18 19:53:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 19:53:58,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:58,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:58,889 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 230274807, now seen corresponding path program 1 times [2019-12-18 19:53:58,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:58,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017220920] [2019-12-18 19:53:58,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:53:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:53:59,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017220920] [2019-12-18 19:53:59,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:53:59,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 19:53:59,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742611088] [2019-12-18 19:53:59,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:53:59,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:53:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:53:59,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:53:59,124 INFO L87 Difference]: Start difference. First operand 918 states and 1909 transitions. Second operand 9 states. [2019-12-18 19:53:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:53:59,901 INFO L93 Difference]: Finished difference Result 1501 states and 2965 transitions. [2019-12-18 19:53:59,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:53:59,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-12-18 19:53:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:53:59,904 INFO L225 Difference]: With dead ends: 1501 [2019-12-18 19:53:59,904 INFO L226 Difference]: Without dead ends: 1477 [2019-12-18 19:53:59,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:53:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2019-12-18 19:53:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1196. [2019-12-18 19:53:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2019-12-18 19:53:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2410 transitions. [2019-12-18 19:53:59,924 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2410 transitions. Word has length 70 [2019-12-18 19:53:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:53:59,924 INFO L462 AbstractCegarLoop]: Abstraction has 1196 states and 2410 transitions. [2019-12-18 19:53:59,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:53:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2410 transitions. [2019-12-18 19:53:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 19:53:59,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:53:59,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:53:59,927 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:53:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:53:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash 533493023, now seen corresponding path program 2 times [2019-12-18 19:53:59,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:53:59,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408591634] [2019-12-18 19:53:59,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:53:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:54:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:54:00,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408591634] [2019-12-18 19:54:00,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:54:00,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:54:00,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256990543] [2019-12-18 19:54:00,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:54:00,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:54:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:54:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:54:00,039 INFO L87 Difference]: Start difference. First operand 1196 states and 2410 transitions. Second operand 5 states. [2019-12-18 19:54:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:54:00,116 INFO L93 Difference]: Finished difference Result 1335 states and 2682 transitions. [2019-12-18 19:54:00,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:54:00,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-18 19:54:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:54:00,118 INFO L225 Difference]: With dead ends: 1335 [2019-12-18 19:54:00,119 INFO L226 Difference]: Without dead ends: 1335 [2019-12-18 19:54:00,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:54:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-12-18 19:54:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1144. [2019-12-18 19:54:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-18 19:54:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2312 transitions. [2019-12-18 19:54:00,141 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2312 transitions. Word has length 70 [2019-12-18 19:54:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:54:00,141 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2312 transitions. [2019-12-18 19:54:00,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:54:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2312 transitions. [2019-12-18 19:54:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 19:54:00,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:54:00,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:54:00,145 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:54:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:54:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash 309404191, now seen corresponding path program 1 times [2019-12-18 19:54:00,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:54:00,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141259415] [2019-12-18 19:54:00,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:54:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:54:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:54:00,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:54:00,300 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:54:00,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_23) (= v_~main$tmp_guard0~0_9 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_23|)) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t0~0.base_23|) (= v_~y$r_buff0_thd1~0_79 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~__unbuffered_cnt~0_17) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t0~0.base_23| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_23| 1) |v_#valid_46|) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~weak$$choice2~0_36) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_23|) |v_ULTIMATE.start_main_~#t0~0.offset_18| 0))) (= v_~y$r_buff0_thd2~0_63 0) (= v_~y$r_buff0_thd0~0_19 0) (= v_~y$w_buff0_used~0_136 0) (= 0 v_~y$flush_delayed~0_18) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~y~0_32 0) (= v_~y$mem_tmp~0_14 0) (= v_~main$tmp_guard1~0_14 0) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~y$w_buff1~0_32) (= |v_ULTIMATE.start_main_~#t0~0.offset_18| 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$r_buff1_thd2~0_38) (= 0 v_~y$w_buff0~0_34) (= 0 v_~x~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_11|, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_18|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_11|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_79, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ~y~0=v_~y~0_32, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_23|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_38, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_46|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_36, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_23, ~x~0=v_~x~0_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_~#t0~0.offset, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t0~0.base, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:54:00,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L5-->L744: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In316718360)) (= ~y$r_buff0_thd0~0_In316718360 ~y$r_buff1_thd0~0_Out316718360) (= ~y$r_buff0_thd1~0_In316718360 ~y$r_buff1_thd1~0_Out316718360) (= |P0Thread1of1ForFork1_#t~nondet4_In316718360| ~weak$$choice2~0_Out316718360) (= ~weak$$choice2~0_Out316718360 ~y$flush_delayed~0_Out316718360) (= ~y~0_In316718360 ~y$mem_tmp~0_Out316718360) (= |P0Thread1of1ForFork1_#t~nondet3_In316718360| ~weak$$choice0~0_Out316718360) (= 1 ~y$r_buff0_thd1~0_Out316718360) (= ~y$r_buff1_thd2~0_Out316718360 ~y$r_buff0_thd2~0_In316718360)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In316718360, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In316718360, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In316718360, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In316718360, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In316718360|, ~y~0=~y~0_In316718360, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In316718360|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out316718360, ~weak$$choice0~0=~weak$$choice0~0_Out316718360, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out316718360, ~y$mem_tmp~0=~y$mem_tmp~0_Out316718360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In316718360, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out316718360, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In316718360, ~y$flush_delayed~0=~y$flush_delayed~0_Out316718360, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In316718360, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out316718360|, ~y~0=~y~0_In316718360, ~weak$$choice2~0=~weak$$choice2~0_Out316718360, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out316718360|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out316718360} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 19:54:00,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L818-1-->L820: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1~0.base_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t1~0.base_11| 0)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-18 19:54:00,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1653236098 256))) (.cse0 (= |P0Thread1of1ForFork1_#t~ite6_Out1653236098| |P0Thread1of1ForFork1_#t~ite5_Out1653236098|)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1653236098 256)))) (or (and .cse0 (= ~y$w_buff1~0_In1653236098 |P0Thread1of1ForFork1_#t~ite5_Out1653236098|) (or .cse1 .cse2)) (and (not .cse2) .cse0 (not .cse1) (= ~y$w_buff0~0_In1653236098 |P0Thread1of1ForFork1_#t~ite5_Out1653236098|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1653236098, ~y$w_buff1~0=~y$w_buff1~0_In1653236098, ~y$w_buff0~0=~y$w_buff0~0_In1653236098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1653236098} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1653236098|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1653236098, ~y$w_buff1~0=~y$w_buff1~0_In1653236098, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1653236098|, ~y$w_buff0~0=~y$w_buff0~0_In1653236098, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1653236098} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 19:54:00,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_48)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 19:54:00,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-180734274 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-180734274 |P0Thread1of1ForFork1_#t~ite25_Out-180734274|)) (and .cse0 (= ~y~0_In-180734274 |P0Thread1of1ForFork1_#t~ite25_Out-180734274|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-180734274, ~y$flush_delayed~0=~y$flush_delayed~0_In-180734274, ~y~0=~y~0_In-180734274} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-180734274, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-180734274|, ~y$flush_delayed~0=~y$flush_delayed~0_In-180734274, ~y~0=~y~0_In-180734274} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 19:54:00,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In937424543 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out937424543| ~y~0_In937424543) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out937424543| ~y$mem_tmp~0_In937424543)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In937424543, ~y$flush_delayed~0=~y$flush_delayed~0_In937424543, ~y~0=~y~0_In937424543} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In937424543, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out937424543|, ~y$flush_delayed~0=~y$flush_delayed~0_In937424543, ~y~0=~y~0_In937424543} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 19:54:00,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In336251515 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In336251515 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out336251515|)) (and (= ~y$w_buff0_used~0_In336251515 |P0Thread1of1ForFork1_#t~ite28_Out336251515|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In336251515, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In336251515} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In336251515, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out336251515|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In336251515} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 19:54:00,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In989308046 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In989308046 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In989308046 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In989308046 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite29_Out989308046|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In989308046 |P0Thread1of1ForFork1_#t~ite29_Out989308046|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In989308046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In989308046, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In989308046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In989308046} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In989308046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In989308046, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out989308046|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In989308046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In989308046} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 19:54:00,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-321896045 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-321896045 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-321896045 ~y$r_buff0_thd1~0_In-321896045)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-321896045) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-321896045, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-321896045} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-321896045, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-321896045, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-321896045|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 19:54:00,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1811145587 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1811145587 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1811145587 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1811145587 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1811145587 |P0Thread1of1ForFork1_#t~ite31_Out1811145587|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite31_Out1811145587|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1811145587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1811145587, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1811145587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1811145587} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1811145587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1811145587, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1811145587, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1811145587|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1811145587} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 19:54:00,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1894105783 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1894105783 256)))) (or (and (= ~y~0_In1894105783 |P1Thread1of1ForFork0_#t~ite55_Out1894105783|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In1894105783 |P1Thread1of1ForFork0_#t~ite55_Out1894105783|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894105783, ~y$w_buff1~0=~y$w_buff1~0_In1894105783, ~y~0=~y~0_In1894105783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894105783} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894105783, ~y$w_buff1~0=~y$w_buff1~0_In1894105783, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1894105783|, ~y~0=~y~0_In1894105783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894105783} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-18 19:54:00,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_27 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_7|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-18 19:54:00,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In382701272 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In382701272 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out382701272| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite57_Out382701272| ~y$w_buff0_used~0_In382701272)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In382701272, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In382701272} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In382701272, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In382701272, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out382701272|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-18 19:54:00,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-491470826 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-491470826 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-491470826 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-491470826 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out-491470826| ~y$w_buff1_used~0_In-491470826) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite58_Out-491470826| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-491470826, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-491470826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-491470826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-491470826} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-491470826, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-491470826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-491470826, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-491470826|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-491470826} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-18 19:54:00,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1549138175 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1549138175 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite59_Out-1549138175| ~y$r_buff0_thd2~0_In-1549138175)) (and (= |P1Thread1of1ForFork0_#t~ite59_Out-1549138175| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1549138175, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1549138175} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1549138175, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1549138175, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1549138175|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-18 19:54:00,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd1~0_36 |v_P0Thread1of1ForFork1_#t~ite31_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_8|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 19:54:00,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-1277498235 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1277498235 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1277498235 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1277498235 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-1277498235| ~y$r_buff1_thd2~0_In-1277498235)) (and (= 0 |P1Thread1of1ForFork0_#t~ite60_Out-1277498235|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1277498235, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277498235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1277498235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1277498235} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1277498235, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1277498235, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1277498235|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1277498235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1277498235} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-18 19:54:00,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y$r_buff1_thd2~0_34 |v_P1Thread1of1ForFork0_#t~ite60_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 19:54:00,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 19:54:00,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite64_Out281587123| |ULTIMATE.start_main_#t~ite63_Out281587123|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In281587123 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In281587123 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In281587123 |ULTIMATE.start_main_#t~ite63_Out281587123|)) (and .cse0 (not .cse1) (= ~y$w_buff1~0_In281587123 |ULTIMATE.start_main_#t~ite63_Out281587123|) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In281587123, ~y~0=~y~0_In281587123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In281587123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In281587123} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out281587123|, ~y$w_buff1~0=~y$w_buff1~0_In281587123, ~y~0=~y~0_In281587123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In281587123, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out281587123|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In281587123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 19:54:00,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1309526817 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1309526817 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out1309526817| 0)) (and (= ~y$w_buff0_used~0_In1309526817 |ULTIMATE.start_main_#t~ite65_Out1309526817|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1309526817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1309526817} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1309526817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1309526817, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1309526817|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-18 19:54:00,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-2146526228 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-2146526228 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2146526228 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2146526228 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite66_Out-2146526228|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite66_Out-2146526228| ~y$w_buff1_used~0_In-2146526228) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146526228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2146526228, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2146526228, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146526228} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146526228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2146526228, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-2146526228|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2146526228, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146526228} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-18 19:54:00,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In83094544 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In83094544 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out83094544|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In83094544 |ULTIMATE.start_main_#t~ite67_Out83094544|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In83094544, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In83094544} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In83094544, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In83094544, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out83094544|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-18 19:54:00,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In1298622944 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1298622944 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1298622944 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1298622944 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out1298622944| ~y$r_buff1_thd0~0_In1298622944) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite68_Out1298622944| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1298622944, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1298622944, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1298622944, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1298622944} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1298622944, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1298622944, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1298622944|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1298622944, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1298622944} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 19:54:00,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_~__unbuffered_p0_EAX~0_9 1) (= 0 v_~__unbuffered_p1_EBX~0_9) (= |v_ULTIMATE.start_main_#t~ite68_15| v_~y$r_buff1_thd0~0_20)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_15|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:54:00,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:54:00 BasicIcfg [2019-12-18 19:54:00,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:54:00,468 INFO L168 Benchmark]: Toolchain (without parser) took 21078.10 ms. Allocated memory was 138.9 MB in the beginning and 829.4 MB in the end (delta: 690.5 MB). Free memory was 102.3 MB in the beginning and 668.5 MB in the end (delta: -566.3 MB). Peak memory consumption was 641.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:54:00,471 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 19:54:00,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.96 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 156.1 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:54:00,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.23 ms. Allocated memory is still 203.4 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:54:00,473 INFO L168 Benchmark]: Boogie Preprocessor took 42.00 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:54:00,473 INFO L168 Benchmark]: RCFGBuilder took 1075.80 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 94.0 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:54:00,474 INFO L168 Benchmark]: TraceAbstraction took 19119.90 ms. Allocated memory was 203.4 MB in the beginning and 829.4 MB in the end (delta: 626.0 MB). Free memory was 94.0 MB in the beginning and 668.5 MB in the end (delta: -574.5 MB). Peak memory consumption was 568.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:54:00,478 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.96 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 156.1 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.23 ms. Allocated memory is still 203.4 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.00 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1075.80 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 94.0 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19119.90 ms. Allocated memory was 203.4 MB in the beginning and 829.4 MB in the end (delta: 626.0 MB). Free memory was 94.0 MB in the beginning and 668.5 MB in the end (delta: -574.5 MB). Peak memory consumption was 568.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 191 ProgramPointsBefore, 116 ProgramPointsAfterwards, 246 TransitionsBefore, 141 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 9313 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 156567 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4020 SDtfs, 3310 SDslu, 8960 SDs, 0 SdLazy, 2976 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 13149 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 722 ConstructedInterpolants, 0 QuantifiedInterpolants, 188506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...