/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:27:20,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:27:20,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:27:20,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:27:21,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:27:21,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:27:21,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:27:21,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:27:21,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:27:21,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:27:21,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:27:21,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:27:21,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:27:21,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:27:21,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:27:21,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:27:21,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:27:21,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:27:21,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:27:21,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:27:21,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:27:21,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:27:21,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:27:21,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:27:21,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:27:21,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:27:21,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:27:21,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:27:21,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:27:21,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:27:21,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:27:21,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:27:21,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:27:21,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:27:21,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:27:21,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:27:21,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:27:21,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:27:21,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:27:21,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:27:21,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:27:21,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:27:21,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:27:21,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:27:21,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:27:21,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:27:21,074 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:27:21,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:27:21,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:27:21,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:27:21,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:27:21,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:27:21,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:27:21,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:27:21,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:27:21,076 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:27:21,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:27:21,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:27:21,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:27:21,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:27:21,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:27:21,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:27:21,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:27:21,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:27:21,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:27:21,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:27:21,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:27:21,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:27:21,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:27:21,079 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:27:21,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:27:21,080 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:27:21,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:27:21,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:27:21,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:27:21,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:27:21,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:27:21,382 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:27:21,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-27 15:27:21,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975c4551/616764e6874647b2852f4e566c4df4ae/FLAGf372527b1 [2019-12-27 15:27:22,019 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:27:22,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-27 15:27:22,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975c4551/616764e6874647b2852f4e566c4df4ae/FLAGf372527b1 [2019-12-27 15:27:22,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0975c4551/616764e6874647b2852f4e566c4df4ae [2019-12-27 15:27:22,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:27:22,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:27:22,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:27:22,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:27:22,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:27:22,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:27:22" (1/1) ... [2019-12-27 15:27:22,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42951733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:22, skipping insertion in model container [2019-12-27 15:27:22,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:27:22" (1/1) ... [2019-12-27 15:27:22,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:27:22,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:27:23,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:27:23,062 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:27:23,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:27:23,201 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:27:23,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23 WrapperNode [2019-12-27 15:27:23,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:27:23,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:27:23,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:27:23,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:27:23,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:27:23,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:27:23,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:27:23,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:27:23,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... [2019-12-27 15:27:23,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:27:23,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:27:23,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:27:23,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:27:23,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:27:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:27:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:27:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:27:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:27:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:27:23,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:27:23,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:27:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:27:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:27:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:27:23,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:27:23,442 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:27:24,404 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:27:24,404 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:27:24,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:27:24 BoogieIcfgContainer [2019-12-27 15:27:24,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:27:24,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:27:24,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:27:24,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:27:24,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:27:22" (1/3) ... [2019-12-27 15:27:24,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de0d0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:27:24, skipping insertion in model container [2019-12-27 15:27:24,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:27:23" (2/3) ... [2019-12-27 15:27:24,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de0d0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:27:24, skipping insertion in model container [2019-12-27 15:27:24,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:27:24" (3/3) ... [2019-12-27 15:27:24,414 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc.i [2019-12-27 15:27:24,423 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:27:24,424 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:27:24,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:27:24,438 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:27:24,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,509 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,585 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,589 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:27:24,605 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 15:27:24,626 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:27:24,627 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:27:24,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:27:24,627 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:27:24,627 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:27:24,627 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:27:24,627 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:27:24,627 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:27:24,652 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 15:27:24,654 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 15:27:24,790 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 15:27:24,791 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:27:24,813 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. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 15:27:24,843 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 15:27:24,917 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 15:27:24,918 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:27:24,930 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. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 15:27:24,965 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 15:27:24,966 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:27:30,183 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-12-27 15:27:31,040 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 15:27:31,144 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 15:27:31,204 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-27 15:27:31,204 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 15:27:31,208 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-27 15:27:33,053 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-27 15:27:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-27 15:27:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:27:33,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:33,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:27:33,062 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-27 15:27:33,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:33,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884144202] [2019-12-27 15:27:33,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:33,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884144202] [2019-12-27 15:27:33,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:33,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:27:33,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409797161] [2019-12-27 15:27:33,298 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:33,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:33,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:27:33,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:33,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:33,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:33,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:33,326 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-27 15:27:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:34,471 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-27 15:27:34,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:34,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:27:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:34,689 INFO L225 Difference]: With dead ends: 29506 [2019-12-27 15:27:34,689 INFO L226 Difference]: Without dead ends: 27490 [2019-12-27 15:27:34,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-27 15:27:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-27 15:27:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-27 15:27:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-27 15:27:36,209 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-27 15:27:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:36,209 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-27 15:27:36,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-27 15:27:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:27:36,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:36,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:36,214 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash -271665278, now seen corresponding path program 1 times [2019-12-27 15:27:36,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:36,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723426595] [2019-12-27 15:27:36,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:36,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723426595] [2019-12-27 15:27:36,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:36,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:36,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1986335299] [2019-12-27 15:27:36,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:36,292 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:36,297 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:27:36,298 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:36,298 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:36,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:36,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:36,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:36,301 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-27 15:27:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:36,370 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-27 15:27:36,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:36,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:27:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:36,381 INFO L225 Difference]: With dead ends: 3269 [2019-12-27 15:27:36,382 INFO L226 Difference]: Without dead ends: 3269 [2019-12-27 15:27:36,382 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-27 15:27:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-27 15:27:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-27 15:27:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-27 15:27:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-27 15:27:36,476 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-27 15:27:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:36,476 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-27 15:27:36,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-27 15:27:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:27:36,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:36,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:36,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-27 15:27:36,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:36,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798525857] [2019-12-27 15:27:36,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:36,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798525857] [2019-12-27 15:27:36,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:36,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:36,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1090241521] [2019-12-27 15:27:36,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:36,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:36,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 15:27:36,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:36,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:36,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:27:36,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:27:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:27:36,605 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-27 15:27:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:36,920 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-27 15:27:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:27:36,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 15:27:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:36,936 INFO L225 Difference]: With dead ends: 4313 [2019-12-27 15:27:36,936 INFO L226 Difference]: Without dead ends: 4313 [2019-12-27 15:27:36,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-27 15:27:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-27 15:27:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-27 15:27:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-27 15:27:37,107 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-27 15:27:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:37,107 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-27 15:27:37,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:27:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-27 15:27:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:27:37,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:37,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:37,109 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash 566526627, now seen corresponding path program 1 times [2019-12-27 15:27:37,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:37,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900590248] [2019-12-27 15:27:37,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:37,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900590248] [2019-12-27 15:27:37,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:37,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:37,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [415965678] [2019-12-27 15:27:37,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:37,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:37,157 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 15:27:37,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:37,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:37,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:37,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:37,159 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-27 15:27:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:37,261 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-27 15:27:37,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:37,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 15:27:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:37,278 INFO L225 Difference]: With dead ends: 7552 [2019-12-27 15:27:37,278 INFO L226 Difference]: Without dead ends: 7552 [2019-12-27 15:27:37,279 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-27 15:27:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-27 15:27:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-27 15:27:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-27 15:27:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-27 15:27:37,424 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-27 15:27:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:37,424 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-27 15:27:37,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-27 15:27:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:27:37,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:37,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:37,427 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1206588916, now seen corresponding path program 1 times [2019-12-27 15:27:37,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:37,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517004922] [2019-12-27 15:27:37,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:37,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517004922] [2019-12-27 15:27:37,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:37,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:37,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211289117] [2019-12-27 15:27:37,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:37,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:37,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 15:27:37,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:37,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:37,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:27:37,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:27:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:27:37,486 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-27 15:27:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:37,789 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-27 15:27:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:27:37,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 15:27:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:37,818 INFO L225 Difference]: With dead ends: 7957 [2019-12-27 15:27:37,819 INFO L226 Difference]: Without dead ends: 7957 [2019-12-27 15:27:37,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-27 15:27:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-27 15:27:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-27 15:27:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-27 15:27:37,951 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-27 15:27:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:37,952 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-27 15:27:37,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:27:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-27 15:27:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:27:37,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:37,957 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-27 15:27:37,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:37,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1293061293, now seen corresponding path program 1 times [2019-12-27 15:27:37,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:37,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246737110] [2019-12-27 15:27:37,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:38,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246737110] [2019-12-27 15:27:38,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:38,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:38,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925582742] [2019-12-27 15:27:38,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:38,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:38,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:27:38,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:38,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:38,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:38,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:38,045 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-27 15:27:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:38,461 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-27 15:27:38,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:27:38,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 15:27:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:38,477 INFO L225 Difference]: With dead ends: 8876 [2019-12-27 15:27:38,478 INFO L226 Difference]: Without dead ends: 8876 [2019-12-27 15:27:38,478 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-27 15:27:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-27 15:27:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-27 15:27:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-27 15:27:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-27 15:27:38,760 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-27 15:27:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:38,760 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-27 15:27:38,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-27 15:27:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 15:27:38,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:38,771 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-27 15:27:38,771 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1277893089, now seen corresponding path program 1 times [2019-12-27 15:27:38,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:38,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224717379] [2019-12-27 15:27:38,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:38,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224717379] [2019-12-27 15:27:38,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:38,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:38,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801142248] [2019-12-27 15:27:38,843 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:38,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:38,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 30 transitions. [2019-12-27 15:27:38,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:38,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:38,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:38,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:38,860 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-27 15:27:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:38,946 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-27 15:27:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:38,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 15:27:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:38,961 INFO L225 Difference]: With dead ends: 9584 [2019-12-27 15:27:38,961 INFO L226 Difference]: Without dead ends: 9584 [2019-12-27 15:27:38,961 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-27 15:27:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-27 15:27:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-27 15:27:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-27 15:27:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-27 15:27:39,148 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-27 15:27:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:39,149 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-27 15:27:39,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-27 15:27:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:27:39,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:39,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:39,160 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1657093328, now seen corresponding path program 1 times [2019-12-27 15:27:39,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:39,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128142157] [2019-12-27 15:27:39,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:39,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128142157] [2019-12-27 15:27:39,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:39,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:39,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930022340] [2019-12-27 15:27:39,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:39,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:39,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 15:27:39,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:39,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:39,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:39,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:39,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:39,278 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-27 15:27:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:39,702 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-27 15:27:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:27:39,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 15:27:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:39,717 INFO L225 Difference]: With dead ends: 9537 [2019-12-27 15:27:39,717 INFO L226 Difference]: Without dead ends: 9537 [2019-12-27 15:27:39,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:27:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-27 15:27:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-27 15:27:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-27 15:27:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-27 15:27:39,869 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-27 15:27:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:39,870 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-27 15:27:39,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-27 15:27:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:27:39,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:39,882 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-27 15:27:39,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1233120795, now seen corresponding path program 1 times [2019-12-27 15:27:39,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:39,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930691941] [2019-12-27 15:27:39,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:39,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930691941] [2019-12-27 15:27:39,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:39,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:39,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902983470] [2019-12-27 15:27:39,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:39,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:39,958 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-27 15:27:39,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:39,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:39,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:27:39,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:27:39,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:27:39,959 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-27 15:27:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:39,992 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-27 15:27:39,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:27:39,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 15:27:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:39,999 INFO L225 Difference]: With dead ends: 5263 [2019-12-27 15:27:40,000 INFO L226 Difference]: Without dead ends: 5263 [2019-12-27 15:27:40,000 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-27 15:27:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-27 15:27:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-27 15:27:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-27 15:27:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-27 15:27:40,097 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-27 15:27:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:40,097 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-27 15:27:40,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:27:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-27 15:27:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 15:27:40,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:40,113 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-27 15:27:40,113 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash 184713789, now seen corresponding path program 1 times [2019-12-27 15:27:40,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:40,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066710583] [2019-12-27 15:27:40,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:40,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066710583] [2019-12-27 15:27:40,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:40,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:27:40,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625758910] [2019-12-27 15:27:40,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:40,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:40,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 15:27:40,521 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:40,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 15:27:40,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:27:40,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:27:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:27:40,701 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 12 states. [2019-12-27 15:27:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:41,352 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-27 15:27:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 15:27:41,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 15:27:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:41,364 INFO L225 Difference]: With dead ends: 9824 [2019-12-27 15:27:41,364 INFO L226 Difference]: Without dead ends: 8719 [2019-12-27 15:27:41,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:27:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-27 15:27:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-27 15:27:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-27 15:27:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-27 15:27:41,495 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-27 15:27:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:41,495 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-27 15:27:41,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:27:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-27 15:27:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 15:27:41,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:41,508 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-27 15:27:41,509 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1779092541, now seen corresponding path program 2 times [2019-12-27 15:27:41,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:41,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859289794] [2019-12-27 15:27:41,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:41,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859289794] [2019-12-27 15:27:41,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:41,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:41,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1367726459] [2019-12-27 15:27:41,621 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:41,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:41,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 299 transitions. [2019-12-27 15:27:41,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:41,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:27:41,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:27:41,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:41,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:27:41,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:27:41,916 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 7 states. [2019-12-27 15:27:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:42,077 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-27 15:27:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:27:42,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 15:27:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:42,086 INFO L225 Difference]: With dead ends: 9381 [2019-12-27 15:27:42,086 INFO L226 Difference]: Without dead ends: 7879 [2019-12-27 15:27:42,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:27:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-27 15:27:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-27 15:27:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-27 15:27:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-27 15:27:42,208 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-27 15:27:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:42,208 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-27 15:27:42,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:27:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-27 15:27:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 15:27:42,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:42,224 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-27 15:27:42,224 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash 89330341, now seen corresponding path program 3 times [2019-12-27 15:27:42,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:42,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635405442] [2019-12-27 15:27:42,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:42,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635405442] [2019-12-27 15:27:42,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:42,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:27:42,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [561525067] [2019-12-27 15:27:42,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:42,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:42,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 198 transitions. [2019-12-27 15:27:42,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:42,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:27:42,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:27:42,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:27:42,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:27:42,511 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 10 states. [2019-12-27 15:27:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:43,073 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-27 15:27:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:27:43,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-27 15:27:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:43,089 INFO L225 Difference]: With dead ends: 11922 [2019-12-27 15:27:43,089 INFO L226 Difference]: Without dead ends: 11455 [2019-12-27 15:27:43,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:27:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-27 15:27:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-27 15:27:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-27 15:27:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-27 15:27:43,368 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-27 15:27:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:43,368 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-27 15:27:43,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:27:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-27 15:27:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 15:27:43,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:43,383 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-27 15:27:43,384 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:43,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1465739931, now seen corresponding path program 4 times [2019-12-27 15:27:43,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:43,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595906045] [2019-12-27 15:27:43,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:43,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595906045] [2019-12-27 15:27:43,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:43,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:43,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1358376965] [2019-12-27 15:27:43,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:43,501 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:43,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 15:27:43,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:43,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:27:43,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:43,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:43,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:43,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:43,654 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 5 states. [2019-12-27 15:27:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:43,783 INFO L93 Difference]: Finished difference Result 8882 states and 19761 transitions. [2019-12-27 15:27:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:27:43,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 15:27:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:43,785 INFO L225 Difference]: With dead ends: 8882 [2019-12-27 15:27:43,786 INFO L226 Difference]: Without dead ends: 1067 [2019-12-27 15:27:43,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:27:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-12-27 15:27:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 890. [2019-12-27 15:27:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 15:27:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-27 15:27:43,798 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-27 15:27:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:43,798 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-27 15:27:43,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-27 15:27:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 15:27:43,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:43,800 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-27 15:27:43,801 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:43,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:43,801 INFO L82 PathProgramCache]: Analyzing trace with hash 542114771, now seen corresponding path program 1 times [2019-12-27 15:27:43,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:43,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572425726] [2019-12-27 15:27:43,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:43,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572425726] [2019-12-27 15:27:43,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:43,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:27:43,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617754249] [2019-12-27 15:27:43,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:43,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:44,067 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 304 transitions. [2019-12-27 15:27:44,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:44,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:27:44,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:44,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:44,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:44,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:44,104 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 5 states. [2019-12-27 15:27:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:44,344 INFO L93 Difference]: Finished difference Result 1006 states and 2057 transitions. [2019-12-27 15:27:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:27:44,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 15:27:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:44,347 INFO L225 Difference]: With dead ends: 1006 [2019-12-27 15:27:44,347 INFO L226 Difference]: Without dead ends: 1006 [2019-12-27 15:27:44,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-27 15:27:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 968. [2019-12-27 15:27:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-12-27 15:27:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1990 transitions. [2019-12-27 15:27:44,360 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1990 transitions. Word has length 69 [2019-12-27 15:27:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:44,360 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1990 transitions. [2019-12-27 15:27:44,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1990 transitions. [2019-12-27 15:27:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 15:27:44,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:44,367 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-27 15:27:44,368 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash 491973003, now seen corresponding path program 2 times [2019-12-27 15:27:44,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:44,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492704697] [2019-12-27 15:27:44,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:44,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492704697] [2019-12-27 15:27:44,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:44,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:27:44,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92937747] [2019-12-27 15:27:44,517 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:44,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:44,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 222 transitions. [2019-12-27 15:27:44,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:44,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:27:44,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 15:27:44,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:27:44,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:27:44,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:27:44,742 INFO L87 Difference]: Start difference. First operand 968 states and 1990 transitions. Second operand 10 states. [2019-12-27 15:27:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:46,144 INFO L93 Difference]: Finished difference Result 3723 states and 7733 transitions. [2019-12-27 15:27:46,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 15:27:46,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-27 15:27:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:46,149 INFO L225 Difference]: With dead ends: 3723 [2019-12-27 15:27:46,149 INFO L226 Difference]: Without dead ends: 3699 [2019-12-27 15:27:46,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:27:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states. [2019-12-27 15:27:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1819. [2019-12-27 15:27:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2019-12-27 15:27:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 3822 transitions. [2019-12-27 15:27:46,179 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 3822 transitions. Word has length 69 [2019-12-27 15:27:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:46,180 INFO L462 AbstractCegarLoop]: Abstraction has 1819 states and 3822 transitions. [2019-12-27 15:27:46,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:27:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 3822 transitions. [2019-12-27 15:27:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 15:27:46,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:46,182 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-27 15:27:46,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1081203753, now seen corresponding path program 3 times [2019-12-27 15:27:46,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:46,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296042096] [2019-12-27 15:27:46,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:46,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296042096] [2019-12-27 15:27:46,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:46,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:27:46,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [830492841] [2019-12-27 15:27:46,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:46,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:46,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 204 transitions. [2019-12-27 15:27:46,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:46,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:27:46,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:27:46,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:46,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:27:46,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:46,440 INFO L87 Difference]: Start difference. First operand 1819 states and 3822 transitions. Second operand 6 states. [2019-12-27 15:27:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:46,779 INFO L93 Difference]: Finished difference Result 2011 states and 4162 transitions. [2019-12-27 15:27:46,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:27:46,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-27 15:27:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:46,782 INFO L225 Difference]: With dead ends: 2011 [2019-12-27 15:27:46,783 INFO L226 Difference]: Without dead ends: 2011 [2019-12-27 15:27:46,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:27:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-12-27 15:27:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1810. [2019-12-27 15:27:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2019-12-27 15:27:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 3804 transitions. [2019-12-27 15:27:46,813 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 3804 transitions. Word has length 69 [2019-12-27 15:27:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:46,813 INFO L462 AbstractCegarLoop]: Abstraction has 1810 states and 3804 transitions. [2019-12-27 15:27:46,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:27:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 3804 transitions. [2019-12-27 15:27:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 15:27:46,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:46,817 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-27 15:27:46,818 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash 378733993, now seen corresponding path program 1 times [2019-12-27 15:27:46,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:46,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377107931] [2019-12-27 15:27:46,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:47,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377107931] [2019-12-27 15:27:47,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:47,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:27:47,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437866367] [2019-12-27 15:27:47,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:47,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:47,167 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 302 transitions. [2019-12-27 15:27:47,167 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:47,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 15:27:47,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 15:27:47,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 15:27:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:27:47,359 INFO L87 Difference]: Start difference. First operand 1810 states and 3804 transitions. Second operand 16 states. [2019-12-27 15:27:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:49,718 INFO L93 Difference]: Finished difference Result 3497 states and 6938 transitions. [2019-12-27 15:27:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:27:49,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2019-12-27 15:27:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:49,724 INFO L225 Difference]: With dead ends: 3497 [2019-12-27 15:27:49,725 INFO L226 Difference]: Without dead ends: 3497 [2019-12-27 15:27:49,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:27:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2019-12-27 15:27:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 1791. [2019-12-27 15:27:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-12-27 15:27:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 3722 transitions. [2019-12-27 15:27:49,786 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 3722 transitions. Word has length 70 [2019-12-27 15:27:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:49,786 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 3722 transitions. [2019-12-27 15:27:49,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 15:27:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3722 transitions. [2019-12-27 15:27:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 15:27:49,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:49,792 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-27 15:27:49,792 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1282533711, now seen corresponding path program 2 times [2019-12-27 15:27:49,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:49,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882924751] [2019-12-27 15:27:49,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:49,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882924751] [2019-12-27 15:27:49,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:49,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:49,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [659904094] [2019-12-27 15:27:49,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:49,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:50,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 232 transitions. [2019-12-27 15:27:50,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:50,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:50,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:50,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:50,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:50,162 INFO L87 Difference]: Start difference. First operand 1791 states and 3722 transitions. Second operand 3 states. [2019-12-27 15:27:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:50,179 INFO L93 Difference]: Finished difference Result 1791 states and 3721 transitions. [2019-12-27 15:27:50,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:50,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 15:27:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:50,182 INFO L225 Difference]: With dead ends: 1791 [2019-12-27 15:27:50,183 INFO L226 Difference]: Without dead ends: 1791 [2019-12-27 15:27:50,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-12-27 15:27:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1569. [2019-12-27 15:27:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2019-12-27 15:27:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 3272 transitions. [2019-12-27 15:27:50,207 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 3272 transitions. Word has length 70 [2019-12-27 15:27:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:50,207 INFO L462 AbstractCegarLoop]: Abstraction has 1569 states and 3272 transitions. [2019-12-27 15:27:50,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 3272 transitions. [2019-12-27 15:27:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 15:27:50,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:50,211 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-27 15:27:50,211 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash 978366752, now seen corresponding path program 1 times [2019-12-27 15:27:50,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:50,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442989149] [2019-12-27 15:27:50,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:27:50,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442989149] [2019-12-27 15:27:50,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:50,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:27:50,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205211038] [2019-12-27 15:27:50,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:50,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:50,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 222 transitions. [2019-12-27 15:27:50,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:50,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:27:50,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:50,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:50,522 INFO L87 Difference]: Start difference. First operand 1569 states and 3272 transitions. Second operand 5 states. [2019-12-27 15:27:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:50,607 INFO L93 Difference]: Finished difference Result 1714 states and 3558 transitions. [2019-12-27 15:27:50,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:27:50,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-27 15:27:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:50,610 INFO L225 Difference]: With dead ends: 1714 [2019-12-27 15:27:50,610 INFO L226 Difference]: Without dead ends: 1714 [2019-12-27 15:27:50,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-12-27 15:27:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1481. [2019-12-27 15:27:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-27 15:27:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 3098 transitions. [2019-12-27 15:27:50,631 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 3098 transitions. Word has length 70 [2019-12-27 15:27:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:50,632 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 3098 transitions. [2019-12-27 15:27:50,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 3098 transitions. [2019-12-27 15:27:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 15:27:50,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:50,635 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-27 15:27:50,635 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:50,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1762924738, now seen corresponding path program 1 times [2019-12-27 15:27:50,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:50,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106539449] [2019-12-27 15:27:50,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:27:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:27:50,761 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:27:50,761 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:27:50,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51| 1)) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t6~0.base_51|) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51|) |v_ULTIMATE.start_main_~#t6~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51|) 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t6~0.offset_32| 0) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t6~0.base_51| 4)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #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_997, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ULTIMATE.start_main_~#t6~0.offset=|v_ULTIMATE.start_main_~#t6~0.offset_32|, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_~#t6~0.base=|v_ULTIMATE.start_main_~#t6~0.base_51|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t7~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t7~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t6~0.offset, ~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, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~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, ULTIMATE.start_main_~#t6~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 15:27:50,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t7~0.offset_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t7~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11|) |v_ULTIMATE.start_main_~#t7~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t7~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t7~0.base, ULTIMATE.start_main_~#t7~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 15:27:50,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~y$r_buff0_thd2~0_In1926850411 ~y$r_buff1_thd2~0_Out1926850411) (= |P0Thread1of1ForFork1_#t~nondet3_In1926850411| ~weak$$choice0~0_Out1926850411) (= ~y$r_buff0_thd1~0_Out1926850411 1) (= ~weak$$choice2~0_Out1926850411 ~y$flush_delayed~0_Out1926850411) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1926850411)) (= ~y$mem_tmp~0_Out1926850411 ~y~0_In1926850411) (= ~y$r_buff0_thd1~0_In1926850411 ~y$r_buff1_thd1~0_Out1926850411) (= ~y$r_buff1_thd0~0_Out1926850411 ~y$r_buff0_thd0~0_In1926850411) (= ~weak$$choice2~0_Out1926850411 |P0Thread1of1ForFork1_#t~nondet4_In1926850411|)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926850411, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1926850411, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1926850411, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1926850411, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1926850411|, ~y~0=~y~0_In1926850411, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1926850411|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1926850411, ~weak$$choice0~0=~weak$$choice0~0_Out1926850411, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1926850411, ~y$mem_tmp~0=~y$mem_tmp~0_Out1926850411, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926850411, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1926850411, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1926850411, ~y$flush_delayed~0=~y$flush_delayed~0_Out1926850411, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1926850411, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1926850411|, ~y~0=~y~0_In1926850411, ~weak$$choice2~0=~weak$$choice2~0_Out1926850411, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1926850411|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1926850411} 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-27 15:27:50,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out-1374272800| |P0Thread1of1ForFork1_#t~ite5_Out-1374272800|)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1374272800 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1374272800 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y$w_buff1~0_In-1374272800 |P0Thread1of1ForFork1_#t~ite5_Out-1374272800|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1374272800| ~y$w_buff0~0_In-1374272800) .cse2 (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1374272800, ~y$w_buff1~0=~y$w_buff1~0_In-1374272800, ~y$w_buff0~0=~y$w_buff0~0_In-1374272800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1374272800} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1374272800|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1374272800, ~y$w_buff1~0=~y$w_buff1~0_In-1374272800, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1374272800|, ~y$w_buff0~0=~y$w_buff0~0_In-1374272800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1374272800} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:27:50,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:27:50,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In492212076 256) 0))) (or (and .cse0 (= ~y~0_In492212076 |P0Thread1of1ForFork1_#t~ite25_Out492212076|)) (and (= |P0Thread1of1ForFork1_#t~ite25_Out492212076| ~y$mem_tmp~0_In492212076) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In492212076, ~y$flush_delayed~0=~y$flush_delayed~0_In492212076, ~y~0=~y~0_In492212076} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In492212076, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out492212076|, ~y$flush_delayed~0=~y$flush_delayed~0_In492212076, ~y~0=~y~0_In492212076} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 15:27:50,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In302564974 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out302564974| ~y~0_In302564974) .cse0) (and (= |P1Thread1of1ForFork0_#t~ite54_Out302564974| ~y$mem_tmp~0_In302564974) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In302564974, ~y$flush_delayed~0=~y$flush_delayed~0_In302564974, ~y~0=~y~0_In302564974} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In302564974, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out302564974|, ~y$flush_delayed~0=~y$flush_delayed~0_In302564974, ~y~0=~y~0_In302564974} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 15:27:50,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1956286646 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1956286646 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1956286646 |P0Thread1of1ForFork1_#t~ite28_Out-1956286646|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-1956286646|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956286646, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1956286646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956286646, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1956286646|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1956286646} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 15:27:50,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-2121081819 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2121081819 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-2121081819 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2121081819 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-2121081819|)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite29_Out-2121081819| ~y$w_buff1_used~0_In-2121081819) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2121081819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2121081819, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2121081819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121081819} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2121081819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2121081819, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-2121081819|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2121081819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2121081819} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 15:27:50,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1758484981 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1758484981 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-1758484981 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-1758484981 ~y$r_buff0_thd1~0_Out-1758484981) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758484981, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1758484981} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758484981, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1758484981, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-1758484981|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 15:27:50,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In586627913 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In586627913 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In586627913 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In586627913 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite31_Out586627913| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite31_Out586627913| ~y$r_buff1_thd1~0_In586627913) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In586627913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In586627913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In586627913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In586627913} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In586627913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In586627913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In586627913, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out586627913|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In586627913} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 15:27:50,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} 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-27 15:27:50,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1707415364 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1707415364 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1707415364 |P1Thread1of1ForFork0_#t~ite55_Out-1707415364|)) (and (not .cse0) (= ~y$w_buff1~0_In-1707415364 |P1Thread1of1ForFork0_#t~ite55_Out-1707415364|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1707415364, ~y$w_buff1~0=~y$w_buff1~0_In-1707415364, ~y~0=~y~0_In-1707415364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1707415364} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1707415364, ~y$w_buff1~0=~y$w_buff1~0_In-1707415364, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1707415364|, ~y~0=~y~0_In-1707415364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1707415364} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 15:27:50,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-27 15:27:50,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In861728023 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In861728023 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite57_Out861728023| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite57_Out861728023| ~y$w_buff0_used~0_In861728023)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In861728023, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In861728023} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In861728023, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In861728023, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out861728023|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 15:27:50,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-491145904 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-491145904 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-491145904 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-491145904 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite58_Out-491145904|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-491145904 |P1Thread1of1ForFork0_#t~ite58_Out-491145904|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-491145904, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-491145904, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-491145904, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-491145904} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-491145904, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-491145904, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-491145904, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-491145904|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-491145904} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 15:27:50,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-129303166 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-129303166 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite59_Out-129303166| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-129303166 |P1Thread1of1ForFork0_#t~ite59_Out-129303166|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-129303166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-129303166} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-129303166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-129303166, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-129303166|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 15:27:50,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-93435758 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-93435758 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-93435758 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-93435758 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-93435758 |P1Thread1of1ForFork0_#t~ite60_Out-93435758|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite60_Out-93435758|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-93435758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-93435758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-93435758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-93435758} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-93435758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-93435758, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-93435758|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-93435758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-93435758} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 15:27:50,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, 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-27 15:27:50,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:27:50,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite63_Out2138111805| |ULTIMATE.start_main_#t~ite64_Out2138111805|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2138111805 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2138111805 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite63_Out2138111805| ~y~0_In2138111805)) (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite63_Out2138111805| ~y$w_buff1~0_In2138111805)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2138111805, ~y~0=~y~0_In2138111805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2138111805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2138111805} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2138111805|, ~y$w_buff1~0=~y$w_buff1~0_In2138111805, ~y~0=~y~0_In2138111805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2138111805, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out2138111805|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2138111805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 15:27:50,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In346546361 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In346546361 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out346546361| ~y$w_buff0_used~0_In346546361) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite65_Out346546361| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In346546361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In346546361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In346546361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In346546361, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out346546361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 15:27:50,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-948535044 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-948535044 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-948535044 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-948535044 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out-948535044|)) (and (= ~y$w_buff1_used~0_In-948535044 |ULTIMATE.start_main_#t~ite66_Out-948535044|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-948535044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-948535044, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-948535044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948535044} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-948535044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-948535044, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-948535044|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-948535044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948535044} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 15:27:50,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-798700785 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-798700785 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite67_Out-798700785|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-798700785 |ULTIMATE.start_main_#t~ite67_Out-798700785|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-798700785, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-798700785} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-798700785, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-798700785, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-798700785|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 15:27:50,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-1257853545 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1257853545 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1257853545 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1257853545 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out-1257853545|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1257853545 |ULTIMATE.start_main_#t~ite68_Out-1257853545|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1257853545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1257853545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1257853545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1257853545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1257853545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1257853545, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1257853545|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1257853545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1257853545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 15:27:50,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~__unbuffered_p0_EBX~0_46 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} 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-27 15:27:50,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:27:50 BasicIcfg [2019-12-27 15:27:50,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:27:50,966 INFO L168 Benchmark]: Toolchain (without parser) took 28662.54 ms. Allocated memory was 137.4 MB in the beginning and 1.1 GB in the end (delta: 984.1 MB). Free memory was 99.8 MB in the beginning and 511.6 MB in the end (delta: -411.7 MB). Peak memory consumption was 572.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:50,966 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 15:27:50,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 897.54 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 151.4 MB in the end (delta: -51.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:50,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.12 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:50,969 INFO L168 Benchmark]: Boogie Preprocessor took 74.68 ms. Allocated memory is still 200.8 MB. Free memory was 148.4 MB in the beginning and 146.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:50,970 INFO L168 Benchmark]: RCFGBuilder took 1053.73 ms. Allocated memory is still 200.8 MB. Free memory was 146.3 MB in the beginning and 89.9 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:50,971 INFO L168 Benchmark]: TraceAbstraction took 26557.55 ms. Allocated memory was 200.8 MB in the beginning and 1.1 GB in the end (delta: 920.6 MB). Free memory was 88.9 MB in the beginning and 511.6 MB in the end (delta: -422.7 MB). Peak memory consumption was 498.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:50,979 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.18 ms. Allocated memory is still 137.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 897.54 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 151.4 MB in the end (delta: -51.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.12 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.68 ms. Allocated memory is still 200.8 MB. Free memory was 148.4 MB in the beginning and 146.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1053.73 ms. Allocated memory is still 200.8 MB. Free memory was 146.3 MB in the beginning and 89.9 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26557.55 ms. Allocated memory was 200.8 MB in the beginning and 1.1 GB in the end (delta: 920.6 MB). Free memory was 88.9 MB in the beginning and 511.6 MB in the end (delta: -422.7 MB). Peak memory consumption was 498.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9684 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 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(&t6, ((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] [L820] FCALL, FORK 0 pthread_create(&t7, ((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=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 [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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=2, 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=2, 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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=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=2, 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=1, __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=2, 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=1, __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=2, 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=2, 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: 26.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4373 SDtfs, 5024 SDslu, 11610 SDs, 0 SdLazy, 5285 SolverSat, 310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 109 SyntacticMatches, 23 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred 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: 3.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 16591 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 164115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...