/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:51:19,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:51:19,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:51:19,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:51:19,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:51:19,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:51:19,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:51:19,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:51:19,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:51:19,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:51:19,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:51:19,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:51:19,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:51:19,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:51:19,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:51:19,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:51:19,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:51:19,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:51:19,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:51:19,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:51:19,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:51:19,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:51:19,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:51:19,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:51:19,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:51:19,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:51:19,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:51:19,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:51:19,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:51:19,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:51:19,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:51:19,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:51:19,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:51:19,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:51:19,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:51:19,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:51:19,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:51:19,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:51:19,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:51:19,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:51:19,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:51:19,191 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:51:19,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:51:19,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:51:19,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:51:19,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:51:19,227 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:51:19,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:51:19,228 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:51:19,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:51:19,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:51:19,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:51:19,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:51:19,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:51:19,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:51:19,230 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:51:19,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:51:19,230 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:51:19,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:51:19,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:51:19,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:51:19,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:51:19,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:51:19,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:51:19,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:51:19,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:51:19,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:51:19,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:51:19,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:51:19,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:51:19,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:51:19,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:51:19,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:51:19,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:51:19,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:51:19,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:51:19,539 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:51:19,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2019-12-26 23:51:19,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec568bfaf/1b02549ddc6d46db98e761faff09c52c/FLAG952ca7bd7 [2019-12-26 23:51:20,148 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:51:20,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2019-12-26 23:51:20,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec568bfaf/1b02549ddc6d46db98e761faff09c52c/FLAG952ca7bd7 [2019-12-26 23:51:20,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec568bfaf/1b02549ddc6d46db98e761faff09c52c [2019-12-26 23:51:20,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:51:20,480 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:51:20,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:51:20,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:51:20,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:51:20,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:51:20" (1/1) ... [2019-12-26 23:51:20,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:20, skipping insertion in model container [2019-12-26 23:51:20,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:51:20" (1/1) ... [2019-12-26 23:51:20,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:51:20,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:51:21,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:51:21,174 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:51:21,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:51:21,389 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:51:21,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21 WrapperNode [2019-12-26 23:51:21,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:51:21,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:51:21,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:51:21,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:51:21,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:51:21,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:51:21,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:51:21,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:51:21,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (1/1) ... [2019-12-26 23:51:21,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:51:21,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:51:21,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:51:21,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:51:21,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (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-26 23:51:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:51:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:51:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:51:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:51:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:51:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:51:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:51:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:51:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:51:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:51:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:51:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:51:21,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:51:21,632 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:51:22,374 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:51:22,374 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:51:22,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:51:22 BoogieIcfgContainer [2019-12-26 23:51:22,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:51:22,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:51:22,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:51:22,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:51:22,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:51:20" (1/3) ... [2019-12-26 23:51:22,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d32cc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:51:22, skipping insertion in model container [2019-12-26 23:51:22,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:21" (2/3) ... [2019-12-26 23:51:22,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d32cc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:51:22, skipping insertion in model container [2019-12-26 23:51:22,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:51:22" (3/3) ... [2019-12-26 23:51:22,384 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2019-12-26 23:51:22,392 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:51:22,393 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:51:22,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:51:22,400 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:51:22,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,487 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,487 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,491 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,491 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:22,506 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:51:22,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:51:22,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:51:22,528 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:51:22,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:51:22,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:51:22,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:51:22,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:51:22,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:51:22,548 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-26 23:51:22,550 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-26 23:51:22,648 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-26 23:51:22,649 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:51:22,666 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:51:22,686 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-26 23:51:22,737 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-26 23:51:22,737 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:51:22,745 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:51:22,764 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:51:22,765 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:51:27,898 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:51:28,017 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:51:28,048 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-26 23:51:28,048 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 23:51:28,052 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-26 23:51:43,742 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-26 23:51:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-26 23:51:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:51:43,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:43,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:51:43,750 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:51:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-26 23:51:43,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:43,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752470822] [2019-12-26 23:51:43,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:43,954 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-26 23:51:43,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752470822] [2019-12-26 23:51:43,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:43,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:51:43,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601069093] [2019-12-26 23:51:43,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:51:43,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:43,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:51:43,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:51:43,979 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-26 23:51:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:45,806 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-26 23:51:45,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:51:45,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:51:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:46,649 INFO L225 Difference]: With dead ends: 112536 [2019-12-26 23:51:46,649 INFO L226 Difference]: Without dead ends: 110184 [2019-12-26 23:51:46,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:51:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-26 23:51:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-26 23:51:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-26 23:51:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-26 23:51:59,185 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-26 23:51:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:59,186 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-26 23:51:59,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:51:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-26 23:51:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:51:59,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:59,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:51:59,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:51:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-26 23:51:59,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:59,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798935675] [2019-12-26 23:51:59,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:51:59,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798935675] [2019-12-26 23:51:59,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:59,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:51:59,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526278353] [2019-12-26 23:51:59,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:51:59,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:59,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:51:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:51:59,356 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-26 23:52:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:05,208 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-26 23:52:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:52:05,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:52:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:05,758 INFO L225 Difference]: With dead ends: 172298 [2019-12-26 23:52:05,759 INFO L226 Difference]: Without dead ends: 172249 [2019-12-26 23:52:05,759 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-26 23:52:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-26 23:52:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-26 23:52:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-26 23:52:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-26 23:52:21,183 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-26 23:52:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:21,183 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-26 23:52:21,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:52:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-26 23:52:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:52:21,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:21,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:21,191 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-26 23:52:21,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:21,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020312068] [2019-12-26 23:52:21,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:21,255 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-26 23:52:21,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020312068] [2019-12-26 23:52:21,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:21,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:21,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487006380] [2019-12-26 23:52:21,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:21,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:21,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:21,258 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-26 23:52:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:21,416 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-26 23:52:21,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:21,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:52:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:21,507 INFO L225 Difference]: With dead ends: 32129 [2019-12-26 23:52:21,507 INFO L226 Difference]: Without dead ends: 32129 [2019-12-26 23:52:21,507 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-26 23:52:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-26 23:52:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-26 23:52:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-26 23:52:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-26 23:52:22,122 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-26 23:52:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:22,123 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-26 23:52:22,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-26 23:52:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:52:22,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:22,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:22,125 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-26 23:52:22,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:22,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944532590] [2019-12-26 23:52:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:22,224 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-26 23:52:22,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944532590] [2019-12-26 23:52:22,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:22,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:22,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802227620] [2019-12-26 23:52:22,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:52:22,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:52:22,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:52:22,228 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-26 23:52:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:22,652 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-26 23:52:22,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:52:22,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:52:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:22,742 INFO L225 Difference]: With dead ends: 43159 [2019-12-26 23:52:22,743 INFO L226 Difference]: Without dead ends: 43152 [2019-12-26 23:52:22,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-26 23:52:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-26 23:52:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-26 23:52:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-26 23:52:24,732 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-26 23:52:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:24,732 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-26 23:52:24,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:52:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-26 23:52:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:52:24,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:24,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:24,737 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-26 23:52:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:24,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109804829] [2019-12-26 23:52:24,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:24,856 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-26 23:52:24,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109804829] [2019-12-26 23:52:24,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:24,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:52:24,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049950729] [2019-12-26 23:52:24,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:24,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:24,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:24,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:24,859 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 5 states. [2019-12-26 23:52:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:25,630 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-26 23:52:25,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:52:25,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:52:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:25,710 INFO L225 Difference]: With dead ends: 50788 [2019-12-26 23:52:25,710 INFO L226 Difference]: Without dead ends: 50775 [2019-12-26 23:52:25,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:52:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-26 23:52:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-26 23:52:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-26 23:52:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-26 23:52:27,289 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-26 23:52:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:27,290 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-26 23:52:27,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-26 23:52:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:52:27,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:27,302 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] [2019-12-26 23:52:27,303 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-26 23:52:27,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:27,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763527458] [2019-12-26 23:52:27,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:27,399 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-26 23:52:27,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763527458] [2019-12-26 23:52:27,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:27,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:52:27,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092582020] [2019-12-26 23:52:27,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:52:27,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:52:27,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:52:27,402 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-26 23:52:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:27,439 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-26 23:52:27,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:52:27,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:52:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:27,450 INFO L225 Difference]: With dead ends: 7382 [2019-12-26 23:52:27,451 INFO L226 Difference]: Without dead ends: 7382 [2019-12-26 23:52:27,451 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-26 23:52:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-26 23:52:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-26 23:52:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-26 23:52:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-26 23:52:27,545 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-26 23:52:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:27,545 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-26 23:52:27,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:52:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-26 23:52:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:52:27,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:27,557 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] [2019-12-26 23:52:27,557 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-26 23:52:27,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:27,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975243133] [2019-12-26 23:52:27,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:27,663 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-26 23:52:27,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975243133] [2019-12-26 23:52:27,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:27,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:52:27,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530813036] [2019-12-26 23:52:27,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:27,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:27,665 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 5 states. [2019-12-26 23:52:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:27,703 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-26 23:52:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:52:27,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:52:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:27,712 INFO L225 Difference]: With dead ends: 5311 [2019-12-26 23:52:27,712 INFO L226 Difference]: Without dead ends: 5311 [2019-12-26 23:52:27,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-26 23:52:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-26 23:52:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-26 23:52:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-26 23:52:27,816 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-26 23:52:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:27,816 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-26 23:52:27,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-26 23:52:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:27,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:27,827 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] [2019-12-26 23:52:27,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-26 23:52:27,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:27,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319004493] [2019-12-26 23:52:27,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:27,901 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-26 23:52:27,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319004493] [2019-12-26 23:52:27,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:27,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:52:27,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676435522] [2019-12-26 23:52:27,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:27,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:27,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:27,903 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-26 23:52:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:27,963 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-26 23:52:27,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:27,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:52:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:27,971 INFO L225 Difference]: With dead ends: 4958 [2019-12-26 23:52:27,971 INFO L226 Difference]: Without dead ends: 4958 [2019-12-26 23:52:27,972 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-26 23:52:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-26 23:52:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-26 23:52:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-26 23:52:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-26 23:52:28,067 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-26 23:52:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:28,068 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-26 23:52:28,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-26 23:52:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:28,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:28,078 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] [2019-12-26 23:52:28,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-26 23:52:28,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:28,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576814150] [2019-12-26 23:52:28,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:28,199 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-26 23:52:28,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576814150] [2019-12-26 23:52:28,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:28,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:28,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229019756] [2019-12-26 23:52:28,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:28,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:28,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:28,202 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 3 states. [2019-12-26 23:52:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:28,228 INFO L93 Difference]: Finished difference Result 4666 states and 13243 transitions. [2019-12-26 23:52:28,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:28,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:52:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:28,235 INFO L225 Difference]: With dead ends: 4666 [2019-12-26 23:52:28,236 INFO L226 Difference]: Without dead ends: 4666 [2019-12-26 23:52:28,236 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-26 23:52:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-12-26 23:52:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2019-12-26 23:52:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-26 23:52:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13243 transitions. [2019-12-26 23:52:28,302 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13243 transitions. Word has length 65 [2019-12-26 23:52:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:28,303 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13243 transitions. [2019-12-26 23:52:28,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13243 transitions. [2019-12-26 23:52:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:28,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:28,309 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] [2019-12-26 23:52:28,309 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -707320023, now seen corresponding path program 1 times [2019-12-26 23:52:28,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:28,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440533782] [2019-12-26 23:52:28,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:28,473 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-26 23:52:28,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440533782] [2019-12-26 23:52:28,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:28,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:52:28,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516800142] [2019-12-26 23:52:28,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:28,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:28,475 INFO L87 Difference]: Start difference. First operand 4666 states and 13243 transitions. Second operand 5 states. [2019-12-26 23:52:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:28,825 INFO L93 Difference]: Finished difference Result 7090 states and 19974 transitions. [2019-12-26 23:52:28,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:52:28,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:52:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:28,837 INFO L225 Difference]: With dead ends: 7090 [2019-12-26 23:52:28,837 INFO L226 Difference]: Without dead ends: 7090 [2019-12-26 23:52:28,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-26 23:52:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5825. [2019-12-26 23:52:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-12-26 23:52:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 16556 transitions. [2019-12-26 23:52:28,962 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 16556 transitions. Word has length 66 [2019-12-26 23:52:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:28,963 INFO L462 AbstractCegarLoop]: Abstraction has 5825 states and 16556 transitions. [2019-12-26 23:52:28,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 16556 transitions. [2019-12-26 23:52:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:28,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:28,974 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] [2019-12-26 23:52:28,974 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash 429063715, now seen corresponding path program 2 times [2019-12-26 23:52:28,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:28,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797393778] [2019-12-26 23:52:28,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:29,079 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-26 23:52:29,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797393778] [2019-12-26 23:52:29,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:29,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:52:29,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735453339] [2019-12-26 23:52:29,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:29,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:29,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:29,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:29,081 INFO L87 Difference]: Start difference. First operand 5825 states and 16556 transitions. Second operand 5 states. [2019-12-26 23:52:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:29,402 INFO L93 Difference]: Finished difference Result 8400 states and 23631 transitions. [2019-12-26 23:52:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:52:29,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:52:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:29,413 INFO L225 Difference]: With dead ends: 8400 [2019-12-26 23:52:29,413 INFO L226 Difference]: Without dead ends: 8400 [2019-12-26 23:52:29,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:52:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2019-12-26 23:52:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 6173. [2019-12-26 23:52:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6173 states. [2019-12-26 23:52:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 17589 transitions. [2019-12-26 23:52:29,543 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 17589 transitions. Word has length 66 [2019-12-26 23:52:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:29,543 INFO L462 AbstractCegarLoop]: Abstraction has 6173 states and 17589 transitions. [2019-12-26 23:52:29,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 17589 transitions. [2019-12-26 23:52:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:29,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:29,558 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] [2019-12-26 23:52:29,558 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:29,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2071652769, now seen corresponding path program 3 times [2019-12-26 23:52:29,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:29,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007066503] [2019-12-26 23:52:29,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:29,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007066503] [2019-12-26 23:52:29,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:29,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:52:29,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648036474] [2019-12-26 23:52:29,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:52:29,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:52:29,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:29,667 INFO L87 Difference]: Start difference. First operand 6173 states and 17589 transitions. Second operand 6 states. [2019-12-26 23:52:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:30,202 INFO L93 Difference]: Finished difference Result 8757 states and 24595 transitions. [2019-12-26 23:52:30,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:52:30,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:52:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:30,213 INFO L225 Difference]: With dead ends: 8757 [2019-12-26 23:52:30,213 INFO L226 Difference]: Without dead ends: 8757 [2019-12-26 23:52:30,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:52:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2019-12-26 23:52:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 6362. [2019-12-26 23:52:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6362 states. [2019-12-26 23:52:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 18145 transitions. [2019-12-26 23:52:30,310 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 18145 transitions. Word has length 66 [2019-12-26 23:52:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:30,310 INFO L462 AbstractCegarLoop]: Abstraction has 6362 states and 18145 transitions. [2019-12-26 23:52:30,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:52:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 18145 transitions. [2019-12-26 23:52:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:30,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:30,319 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] [2019-12-26 23:52:30,319 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1231010579, now seen corresponding path program 4 times [2019-12-26 23:52:30,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:30,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512852805] [2019-12-26 23:52:30,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:30,395 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-26 23:52:30,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512852805] [2019-12-26 23:52:30,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:30,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:30,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472088221] [2019-12-26 23:52:30,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:30,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:30,398 INFO L87 Difference]: Start difference. First operand 6362 states and 18145 transitions. Second operand 3 states. [2019-12-26 23:52:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:30,427 INFO L93 Difference]: Finished difference Result 5743 states and 16114 transitions. [2019-12-26 23:52:30,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:30,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:52:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:30,436 INFO L225 Difference]: With dead ends: 5743 [2019-12-26 23:52:30,436 INFO L226 Difference]: Without dead ends: 5743 [2019-12-26 23:52:30,437 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-26 23:52:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2019-12-26 23:52:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 5743. [2019-12-26 23:52:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5743 states. [2019-12-26 23:52:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 16114 transitions. [2019-12-26 23:52:30,547 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 16114 transitions. Word has length 66 [2019-12-26 23:52:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:30,547 INFO L462 AbstractCegarLoop]: Abstraction has 5743 states and 16114 transitions. [2019-12-26 23:52:30,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 16114 transitions. [2019-12-26 23:52:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:52:30,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:30,557 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] [2019-12-26 23:52:30,558 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1336907617, now seen corresponding path program 1 times [2019-12-26 23:52:30,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:30,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567799772] [2019-12-26 23:52:30,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:30,627 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-26 23:52:30,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567799772] [2019-12-26 23:52:30,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:30,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:30,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561782157] [2019-12-26 23:52:30,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:30,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:30,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:30,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:30,629 INFO L87 Difference]: Start difference. First operand 5743 states and 16114 transitions. Second operand 3 states. [2019-12-26 23:52:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:30,694 INFO L93 Difference]: Finished difference Result 5743 states and 16113 transitions. [2019-12-26 23:52:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:30,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:52:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:30,703 INFO L225 Difference]: With dead ends: 5743 [2019-12-26 23:52:30,704 INFO L226 Difference]: Without dead ends: 5743 [2019-12-26 23:52:30,704 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-26 23:52:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2019-12-26 23:52:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 2989. [2019-12-26 23:52:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-26 23:52:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8461 transitions. [2019-12-26 23:52:31,427 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8461 transitions. Word has length 67 [2019-12-26 23:52:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:31,428 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8461 transitions. [2019-12-26 23:52:31,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8461 transitions. [2019-12-26 23:52:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:52:31,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:31,434 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-26 23:52:31,434 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1149441136, now seen corresponding path program 1 times [2019-12-26 23:52:31,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:31,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960063742] [2019-12-26 23:52:31,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:31,797 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-26 23:52:31,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960063742] [2019-12-26 23:52:31,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:31,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:52:31,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237860240] [2019-12-26 23:52:31,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:52:31,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:31,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:52:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:52:31,799 INFO L87 Difference]: Start difference. First operand 2989 states and 8461 transitions. Second operand 14 states. [2019-12-26 23:52:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:32,485 INFO L93 Difference]: Finished difference Result 6499 states and 18532 transitions. [2019-12-26 23:52:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:52:32,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-26 23:52:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:32,495 INFO L225 Difference]: With dead ends: 6499 [2019-12-26 23:52:32,495 INFO L226 Difference]: Without dead ends: 6467 [2019-12-26 23:52:32,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2019-12-26 23:52:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6467 states. [2019-12-26 23:52:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6467 to 4144. [2019-12-26 23:52:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-26 23:52:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-26 23:52:32,562 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 68 [2019-12-26 23:52:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:32,562 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-26 23:52:32,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:52:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-26 23:52:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:52:32,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:32,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:32,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 2 times [2019-12-26 23:52:32,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:32,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342141740] [2019-12-26 23:52:32,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:52:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:52:32,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:52:32,700 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:52:32,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2192~0.base_27|)) (= 0 v_~y$r_buff0_thd3~0_110) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2192~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2192~0.base_27|) |v_ULTIMATE.start_main_~#t2192~0.offset_20| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= 0 v_~y$w_buff0~0_179) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2192~0.base_27| 4)) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2192~0.base_27|) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2192~0.base_27| 1)) (= 0 v_~y$r_buff0_thd2~0_114) (= 0 |v_ULTIMATE.start_main_~#t2192~0.offset_20|) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, ULTIMATE.start_main_~#t2194~0.base=|v_ULTIMATE.start_main_~#t2194~0.base_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2193~0.offset=|v_ULTIMATE.start_main_~#t2193~0.offset_18|, ULTIMATE.start_main_~#t2192~0.base=|v_ULTIMATE.start_main_~#t2192~0.base_27|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ULTIMATE.start_main_~#t2192~0.offset=|v_ULTIMATE.start_main_~#t2192~0.offset_20|, ULTIMATE.start_main_~#t2193~0.base=|v_ULTIMATE.start_main_~#t2193~0.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~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_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ULTIMATE.start_main_~#t2194~0.offset=|v_ULTIMATE.start_main_~#t2194~0.offset_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2194~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2193~0.offset, ULTIMATE.start_main_~#t2192~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2192~0.offset, ULTIMATE.start_main_~#t2193~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2194~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:52:32,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_135 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_28) (= (mod v_~y$w_buff1_used~0_63 256) 0) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:52:32,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2193~0.base_11|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2193~0.base_11|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2193~0.base_11| 1) |v_#valid_37|) (not (= |v_ULTIMATE.start_main_~#t2193~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2193~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2193~0.base_11|) |v_ULTIMATE.start_main_~#t2193~0.offset_10| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t2193~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2193~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2193~0.offset=|v_ULTIMATE.start_main_~#t2193~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2193~0.base=|v_ULTIMATE.start_main_~#t2193~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2193~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2193~0.base] because there is no mapped edge [2019-12-26 23:52:32,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2194~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2194~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2194~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2194~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2194~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2194~0.base_13|) |v_ULTIMATE.start_main_~#t2194~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2194~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2194~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2194~0.offset=|v_ULTIMATE.start_main_~#t2194~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2194~0.base=|v_ULTIMATE.start_main_~#t2194~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2194~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2194~0.base, #length] because there is no mapped edge [2019-12-26 23:52:32,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2050853717 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2050853717 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2050853717| ~y$w_buff0_used~0_In2050853717) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2050853717|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2050853717, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2050853717} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2050853717|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2050853717, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2050853717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:52:32,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1335114517 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1335114517 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1335114517 |P1Thread1of1ForFork1_#t~ite9_Out1335114517|) (not .cse1)) (and (= ~y~0_In1335114517 |P1Thread1of1ForFork1_#t~ite9_Out1335114517|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1335114517, ~y$w_buff1~0=~y$w_buff1~0_In1335114517, ~y~0=~y~0_In1335114517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1335114517} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1335114517, ~y$w_buff1~0=~y$w_buff1~0_In1335114517, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1335114517|, ~y~0=~y~0_In1335114517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1335114517} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-26 23:52:32,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1179010153 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1179010153 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1179010153 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1179010153 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1179010153| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1179010153| ~y$w_buff1_used~0_In-1179010153)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1179010153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1179010153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1179010153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1179010153} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1179010153|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1179010153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1179010153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1179010153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1179010153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:52:32,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-818925099 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-818925099 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out-818925099 ~y$r_buff0_thd1~0_In-818925099) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-818925099)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-818925099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-818925099} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-818925099, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-818925099|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-818925099} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:52:32,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1344914148 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1344914148 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1344914148 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1344914148 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1344914148| ~y$r_buff1_thd1~0_In-1344914148)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1344914148| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1344914148, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344914148, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1344914148, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1344914148} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1344914148, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344914148, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1344914148|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1344914148, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1344914148} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:52:32,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:52:32,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2108251456 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In2108251456 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out2108251456| ~y$w_buff1~0_In2108251456) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out2108251456| ~y~0_In2108251456) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2108251456, ~y$w_buff1~0=~y$w_buff1~0_In2108251456, ~y~0=~y~0_In2108251456, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2108251456} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2108251456, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out2108251456|, ~y$w_buff1~0=~y$w_buff1~0_In2108251456, ~y~0=~y~0_In2108251456, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2108251456} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:52:32,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:52:32,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-26 23:52:32,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1463934898 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1463934898 256) 0))) (or (and (= ~y$w_buff0_used~0_In1463934898 |P1Thread1of1ForFork1_#t~ite11_Out1463934898|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1463934898| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1463934898, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1463934898} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1463934898, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1463934898, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1463934898|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:52:32,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1689506231 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1689506231 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1689506231 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1689506231 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1689506231| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1689506231 |P1Thread1of1ForFork1_#t~ite12_Out-1689506231|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1689506231, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1689506231, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1689506231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1689506231} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1689506231, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1689506231, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1689506231, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1689506231|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1689506231} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:52:32,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1368356189 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1368356189 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1368356189| ~y$r_buff0_thd2~0_In1368356189) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1368356189| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1368356189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1368356189} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1368356189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1368356189, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1368356189|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:52:32,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1449209705 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1449209705 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1449209705 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1449209705 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1449209705 |P1Thread1of1ForFork1_#t~ite14_Out-1449209705|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1449209705| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1449209705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449209705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1449209705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449209705} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1449209705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449209705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1449209705, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1449209705|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449209705} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:52:32,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1362517174 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1362517174 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1362517174| ~y$w_buff0_used~0_In-1362517174) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1362517174| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362517174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1362517174} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362517174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1362517174, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1362517174|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:52:32,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-928311897 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-928311897 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-928311897 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-928311897 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-928311897|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-928311897 |P2Thread1of1ForFork2_#t~ite18_Out-928311897|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-928311897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928311897, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-928311897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928311897} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-928311897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928311897, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-928311897, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-928311897|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928311897} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:52:32,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_42|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:52:32,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-295284655 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-295284655 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-295284655| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-295284655| ~y$r_buff0_thd3~0_In-295284655) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-295284655, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-295284655} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-295284655, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-295284655, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-295284655|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:52:32,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1011215136 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1011215136 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1011215136 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1011215136 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In1011215136 |P2Thread1of1ForFork2_#t~ite20_Out1011215136|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1011215136|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1011215136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011215136, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1011215136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011215136} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1011215136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011215136, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1011215136|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1011215136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011215136} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:52:32,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~y$r_buff1_thd3~0_132) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:52:32,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:52:32,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2043379882 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2043379882 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out2043379882| |ULTIMATE.start_main_#t~ite24_Out2043379882|))) (or (and (= ~y$w_buff1~0_In2043379882 |ULTIMATE.start_main_#t~ite24_Out2043379882|) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) (= ~y~0_In2043379882 |ULTIMATE.start_main_#t~ite24_Out2043379882|) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2043379882, ~y~0=~y~0_In2043379882, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2043379882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2043379882} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2043379882, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2043379882|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out2043379882|, ~y~0=~y~0_In2043379882, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2043379882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2043379882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:52:32,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1487586738 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1487586738 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-1487586738| ~y$w_buff0_used~0_In-1487586738) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1487586738| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1487586738, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1487586738} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1487586738, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1487586738, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1487586738|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:52:32,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1092310223 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1092310223 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1092310223 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1092310223 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1092310223|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1092310223 |ULTIMATE.start_main_#t~ite27_Out1092310223|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1092310223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1092310223, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1092310223, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1092310223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1092310223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1092310223, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1092310223|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1092310223, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1092310223} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:52:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In947035512 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In947035512 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In947035512 |ULTIMATE.start_main_#t~ite28_Out947035512|)) (and (= |ULTIMATE.start_main_#t~ite28_Out947035512| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In947035512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947035512} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out947035512|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In947035512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947035512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:52:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-115586796 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-115586796 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-115586796 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-115586796 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-115586796 |ULTIMATE.start_main_#t~ite29_Out-115586796|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-115586796|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-115586796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-115586796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-115586796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115586796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-115586796, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-115586796|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-115586796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-115586796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115586796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:52:32,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1379507482 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1379507482| |ULTIMATE.start_main_#t~ite39_Out1379507482|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1379507482 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1379507482 256)) .cse0) (= (mod ~y$w_buff0_used~0_In1379507482 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1379507482 256))))) .cse1 (= |ULTIMATE.start_main_#t~ite38_Out1379507482| ~y$w_buff1~0_In1379507482)) (and (= |ULTIMATE.start_main_#t~ite38_In1379507482| |ULTIMATE.start_main_#t~ite38_Out1379507482|) (not .cse1) (= ~y$w_buff1~0_In1379507482 |ULTIMATE.start_main_#t~ite39_Out1379507482|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1379507482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379507482, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1379507482, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1379507482|, ~weak$$choice2~0=~weak$$choice2~0_In1379507482, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1379507482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379507482} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1379507482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379507482, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1379507482|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1379507482, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1379507482|, ~weak$$choice2~0=~weak$$choice2~0_In1379507482, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1379507482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379507482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 23:52:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In166021767 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In166021767 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In166021767 256) 0)) (= (mod ~y$w_buff0_used~0_In166021767 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In166021767 256) 0)))) .cse1 (= |ULTIMATE.start_main_#t~ite42_Out166021767| |ULTIMATE.start_main_#t~ite41_Out166021767|) (= ~y$w_buff0_used~0_In166021767 |ULTIMATE.start_main_#t~ite41_Out166021767|)) (and (= |ULTIMATE.start_main_#t~ite41_In166021767| |ULTIMATE.start_main_#t~ite41_Out166021767|) (= ~y$w_buff0_used~0_In166021767 |ULTIMATE.start_main_#t~ite42_Out166021767|) (not .cse1)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In166021767|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In166021767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In166021767, ~weak$$choice2~0=~weak$$choice2~0_In166021767, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In166021767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In166021767} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out166021767|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In166021767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In166021767, ~weak$$choice2~0=~weak$$choice2~0_In166021767, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out166021767|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In166021767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In166021767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:52:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:52:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:52:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:52:32,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:52:32 BasicIcfg [2019-12-26 23:52:32,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:52:32,810 INFO L168 Benchmark]: Toolchain (without parser) took 72330.91 ms. Allocated memory was 145.2 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 100.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-26 23:52:32,811 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:52:32,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 909.78 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 155.5 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:32,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.87 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:32,813 INFO L168 Benchmark]: Boogie Preprocessor took 53.95 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:32,813 INFO L168 Benchmark]: RCFGBuilder took 818.91 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 100.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:32,814 INFO L168 Benchmark]: TraceAbstraction took 70431.10 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-26 23:52:32,823 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 909.78 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 155.5 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.87 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.95 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.91 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 100.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70431.10 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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) [L804] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 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 [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 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 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 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) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2207 SDtfs, 1910 SDslu, 3840 SDs, 0 SdLazy, 2130 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 23 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 45609 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 117242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...