/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:25:06,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:25:06,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:25:06,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:25:06,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:25:06,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:25:06,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:25:06,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:25:06,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:25:06,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:25:06,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:25:06,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:25:06,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:25:06,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:25:06,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:25:06,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:25:06,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:25:06,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:25:06,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:25:06,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:25:06,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:25:06,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:25:06,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:25:06,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:25:06,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:25:06,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:25:06,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:25:06,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:25:06,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:25:06,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:25:06,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:25:06,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:25:06,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:25:06,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:25:06,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:25:06,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:25:06,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:25:06,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:25:06,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:25:06,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:25:06,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:25:06,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:25:06,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:25:06,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:25:06,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:25:06,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:25:06,379 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:25:06,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:25:06,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:25:06,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:25:06,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:25:06,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:25:06,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:25:06,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:25:06,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:25:06,380 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:25:06,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:25:06,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:25:06,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:25:06,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:25:06,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:25:06,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:25:06,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:25:06,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:25:06,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:25:06,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:25:06,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:25:06,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:25:06,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:25:06,383 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:25:06,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:25:06,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:25:06,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:25:06,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:25:06,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:25:06,667 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:25:06,667 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:25:06,668 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-18 21:25:06,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bedb18b0/9efb11d5a4f3406b860999f99a62ed58/FLAGd94a7a1de [2019-12-18 21:25:07,267 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:25:07,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-18 21:25:07,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bedb18b0/9efb11d5a4f3406b860999f99a62ed58/FLAGd94a7a1de [2019-12-18 21:25:07,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bedb18b0/9efb11d5a4f3406b860999f99a62ed58 [2019-12-18 21:25:07,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:25:07,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:25:07,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:25:07,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:25:07,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:25:07,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:25:07" (1/1) ... [2019-12-18 21:25:07,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:07, skipping insertion in model container [2019-12-18 21:25:07,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:25:07" (1/1) ... [2019-12-18 21:25:07,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:25:07,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:25:08,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:25:08,183 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:25:08,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:25:08,335 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:25:08,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08 WrapperNode [2019-12-18 21:25:08,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:25:08,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:25:08,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:25:08,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:25:08,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:25:08,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:25:08,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:25:08,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:25:08,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... [2019-12-18 21:25:08,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:25:08,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:25:08,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:25:08,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:25:08,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:25:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:25:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:25:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:25:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:25:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:25:08,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:25:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:25:08,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:25:08,540 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:25:08,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:25:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:25:08,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:25:08,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:25:08,543 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:25:09,270 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:25:09,271 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:25:09,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:25:09 BoogieIcfgContainer [2019-12-18 21:25:09,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:25:09,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:25:09,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:25:09,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:25:09,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:25:07" (1/3) ... [2019-12-18 21:25:09,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6342ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:25:09, skipping insertion in model container [2019-12-18 21:25:09,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:08" (2/3) ... [2019-12-18 21:25:09,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6342ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:25:09, skipping insertion in model container [2019-12-18 21:25:09,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:25:09" (3/3) ... [2019-12-18 21:25:09,281 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2019-12-18 21:25:09,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:25:09,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:25:09,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:25:09,299 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:25:09,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,344 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,344 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,385 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:09,398 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:25:09,417 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:25:09,417 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:25:09,417 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:25:09,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:25:09,417 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:25:09,417 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:25:09,418 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:25:09,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:25:09,434 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 21:25:09,436 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:25:09,517 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:25:09,518 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:25:09,537 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:25:09,557 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:25:09,641 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:25:09,641 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:25:09,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:25:09,668 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:25:09,669 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:25:13,253 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 21:25:13,399 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:25:13,418 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-18 21:25:13,418 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 21:25:13,421 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-18 21:25:14,229 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 21:25:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 21:25:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:25:14,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:14,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:14,239 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 21:25:14,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:14,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028121986] [2019-12-18 21:25:14,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:14,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028121986] [2019-12-18 21:25:14,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:14,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:25:14,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154865957] [2019-12-18 21:25:14,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:14,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:14,633 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 21:25:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:15,035 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-18 21:25:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:15,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:25:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:15,225 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 21:25:15,225 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 21:25:15,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 21:25:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 21:25:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 21:25:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-18 21:25:16,017 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-18 21:25:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:16,018 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-18 21:25:16,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-18 21:25:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:25:16,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:16,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:16,023 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:16,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 21:25:16,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:16,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422531244] [2019-12-18 21:25:16,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:16,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422531244] [2019-12-18 21:25:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:16,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:16,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540058600] [2019-12-18 21:25:16,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:16,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:16,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:16,145 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-18 21:25:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:17,322 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-18 21:25:17,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:17,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:25:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:17,404 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 21:25:17,404 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 21:25:17,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 21:25:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 21:25:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 21:25:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-18 21:25:18,194 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-18 21:25:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:18,195 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-18 21:25:18,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-18 21:25:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:25:18,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:18,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:18,198 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 21:25:18,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:18,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025122647] [2019-12-18 21:25:18,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:18,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025122647] [2019-12-18 21:25:18,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:18,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:18,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043151965] [2019-12-18 21:25:18,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:18,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:18,253 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 4 states. [2019-12-18 21:25:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:18,789 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-18 21:25:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:18,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:25:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:18,901 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 21:25:18,901 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 21:25:18,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 21:25:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-18 21:25:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-18 21:25:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-18 21:25:19,808 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-18 21:25:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:19,808 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-18 21:25:19,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-18 21:25:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 21:25:19,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:19,816 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-18 21:25:19,816 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 21:25:19,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:19,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979376699] [2019-12-18 21:25:19,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:19,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-18 21:25:19,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979376699] [2019-12-18 21:25:19,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:19,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:19,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209934481] [2019-12-18 21:25:19,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:19,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:19,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:19,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:19,907 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-18 21:25:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:20,449 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-18 21:25:20,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:25:20,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 21:25:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:21,574 INFO L225 Difference]: With dead ends: 29780 [2019-12-18 21:25:21,574 INFO L226 Difference]: Without dead ends: 29766 [2019-12-18 21:25:21,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-18 21:25:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-18 21:25:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-18 21:25:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-18 21:25:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-18 21:25:22,317 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-18 21:25:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:22,318 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-18 21:25:22,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-18 21:25:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:25:22,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:22,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:22,345 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-18 21:25:22,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:22,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164723989] [2019-12-18 21:25:22,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:22,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164723989] [2019-12-18 21:25:22,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:22,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:22,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428009380] [2019-12-18 21:25:22,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:22,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:22,451 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 6 states. [2019-12-18 21:25:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:23,082 INFO L93 Difference]: Finished difference Result 32226 states and 113712 transitions. [2019-12-18 21:25:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:25:23,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:25:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:23,140 INFO L225 Difference]: With dead ends: 32226 [2019-12-18 21:25:23,140 INFO L226 Difference]: Without dead ends: 32194 [2019-12-18 21:25:23,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-18 21:25:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 27516. [2019-12-18 21:25:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27516 states. [2019-12-18 21:25:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27516 states to 27516 states and 97909 transitions. [2019-12-18 21:25:24,190 INFO L78 Accepts]: Start accepts. Automaton has 27516 states and 97909 transitions. Word has length 27 [2019-12-18 21:25:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:24,190 INFO L462 AbstractCegarLoop]: Abstraction has 27516 states and 97909 transitions. [2019-12-18 21:25:24,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27516 states and 97909 transitions. [2019-12-18 21:25:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:25:24,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:24,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:24,228 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash -386322379, now seen corresponding path program 1 times [2019-12-18 21:25:24,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:24,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794475846] [2019-12-18 21:25:24,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:24,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794475846] [2019-12-18 21:25:24,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:24,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:24,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801100480] [2019-12-18 21:25:24,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:24,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:24,307 INFO L87 Difference]: Start difference. First operand 27516 states and 97909 transitions. Second operand 3 states. [2019-12-18 21:25:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:24,478 INFO L93 Difference]: Finished difference Result 34788 states and 124357 transitions. [2019-12-18 21:25:24,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:24,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 21:25:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:24,540 INFO L225 Difference]: With dead ends: 34788 [2019-12-18 21:25:24,540 INFO L226 Difference]: Without dead ends: 34788 [2019-12-18 21:25:24,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-18 21:25:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 30668. [2019-12-18 21:25:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-18 21:25:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 110245 transitions. [2019-12-18 21:25:25,429 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 110245 transitions. Word has length 33 [2019-12-18 21:25:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:25,429 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 110245 transitions. [2019-12-18 21:25:25,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 110245 transitions. [2019-12-18 21:25:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:25:25,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:25,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:25,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1183375097, now seen corresponding path program 1 times [2019-12-18 21:25:25,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:25,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054037041] [2019-12-18 21:25:25,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:25,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054037041] [2019-12-18 21:25:25,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:25,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:25,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992714434] [2019-12-18 21:25:25,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:25,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:25,528 INFO L87 Difference]: Start difference. First operand 30668 states and 110245 transitions. Second operand 3 states. [2019-12-18 21:25:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:25,898 INFO L93 Difference]: Finished difference Result 30668 states and 109909 transitions. [2019-12-18 21:25:25,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:25,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 21:25:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:25,954 INFO L225 Difference]: With dead ends: 30668 [2019-12-18 21:25:25,955 INFO L226 Difference]: Without dead ends: 30668 [2019-12-18 21:25:25,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-18 21:25:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 30668. [2019-12-18 21:25:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-18 21:25:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 109909 transitions. [2019-12-18 21:25:26,509 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 109909 transitions. Word has length 33 [2019-12-18 21:25:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:26,509 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 109909 transitions. [2019-12-18 21:25:26,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 109909 transitions. [2019-12-18 21:25:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:25:26,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:26,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:26,540 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1422326855, now seen corresponding path program 1 times [2019-12-18 21:25:26,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:26,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948183669] [2019-12-18 21:25:26,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:26,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948183669] [2019-12-18 21:25:26,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:26,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:26,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422813467] [2019-12-18 21:25:26,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:26,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:26,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:26,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:26,615 INFO L87 Difference]: Start difference. First operand 30668 states and 109909 transitions. Second operand 4 states. [2019-12-18 21:25:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:26,860 INFO L93 Difference]: Finished difference Result 17763 states and 54856 transitions. [2019-12-18 21:25:26,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:25:26,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 21:25:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:26,884 INFO L225 Difference]: With dead ends: 17763 [2019-12-18 21:25:26,884 INFO L226 Difference]: Without dead ends: 17233 [2019-12-18 21:25:26,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2019-12-18 21:25:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 17233. [2019-12-18 21:25:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17233 states. [2019-12-18 21:25:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17233 states to 17233 states and 53350 transitions. [2019-12-18 21:25:27,132 INFO L78 Accepts]: Start accepts. Automaton has 17233 states and 53350 transitions. Word has length 33 [2019-12-18 21:25:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:27,132 INFO L462 AbstractCegarLoop]: Abstraction has 17233 states and 53350 transitions. [2019-12-18 21:25:27,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17233 states and 53350 transitions. [2019-12-18 21:25:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:25:27,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:27,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:27,146 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:27,146 INFO L82 PathProgramCache]: Analyzing trace with hash 460610592, now seen corresponding path program 1 times [2019-12-18 21:25:27,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:27,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066426653] [2019-12-18 21:25:27,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:27,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066426653] [2019-12-18 21:25:27,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:27,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:27,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142739505] [2019-12-18 21:25:27,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:27,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:27,242 INFO L87 Difference]: Start difference. First operand 17233 states and 53350 transitions. Second operand 7 states. [2019-12-18 21:25:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:27,958 INFO L93 Difference]: Finished difference Result 26259 states and 79135 transitions. [2019-12-18 21:25:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:25:27,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 21:25:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:27,998 INFO L225 Difference]: With dead ends: 26259 [2019-12-18 21:25:27,998 INFO L226 Difference]: Without dead ends: 26237 [2019-12-18 21:25:27,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:25:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26237 states. [2019-12-18 21:25:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26237 to 17765. [2019-12-18 21:25:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17765 states. [2019-12-18 21:25:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 54932 transitions. [2019-12-18 21:25:28,492 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 54932 transitions. Word has length 34 [2019-12-18 21:25:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:28,493 INFO L462 AbstractCegarLoop]: Abstraction has 17765 states and 54932 transitions. [2019-12-18 21:25:28,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 54932 transitions. [2019-12-18 21:25:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:25:28,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:28,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:28,503 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2030308068, now seen corresponding path program 1 times [2019-12-18 21:25:28,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:28,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183115609] [2019-12-18 21:25:28,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:28,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183115609] [2019-12-18 21:25:28,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:28,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:28,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350197221] [2019-12-18 21:25:28,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:28,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:28,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:28,590 INFO L87 Difference]: Start difference. First operand 17765 states and 54932 transitions. Second operand 7 states. [2019-12-18 21:25:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:29,224 INFO L93 Difference]: Finished difference Result 24195 states and 73310 transitions. [2019-12-18 21:25:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:25:29,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 21:25:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:29,257 INFO L225 Difference]: With dead ends: 24195 [2019-12-18 21:25:29,258 INFO L226 Difference]: Without dead ends: 24182 [2019-12-18 21:25:29,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:25:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24182 states. [2019-12-18 21:25:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24182 to 19705. [2019-12-18 21:25:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-18 21:25:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-18 21:25:29,620 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 34 [2019-12-18 21:25:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:29,621 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-18 21:25:29,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-18 21:25:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:25:29,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:29,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:29,635 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-18 21:25:29,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:29,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873337986] [2019-12-18 21:25:29,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:29,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873337986] [2019-12-18 21:25:29,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:29,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:29,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802378402] [2019-12-18 21:25:29,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:29,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:29,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:29,713 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 5 states. [2019-12-18 21:25:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:29,757 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-18 21:25:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:29,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 21:25:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:29,761 INFO L225 Difference]: With dead ends: 2732 [2019-12-18 21:25:29,761 INFO L226 Difference]: Without dead ends: 2423 [2019-12-18 21:25:29,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-18 21:25:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-18 21:25:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-18 21:25:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-18 21:25:29,797 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-18 21:25:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:29,798 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-18 21:25:29,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-18 21:25:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:25:29,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:29,801 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] [2019-12-18 21:25:29,802 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-18 21:25:29,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:29,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27981924] [2019-12-18 21:25:29,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:29,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27981924] [2019-12-18 21:25:29,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:29,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:29,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177154352] [2019-12-18 21:25:29,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:29,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:29,967 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 6 states. [2019-12-18 21:25:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:30,050 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-18 21:25:30,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:25:30,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 21:25:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:30,052 INFO L225 Difference]: With dead ends: 706 [2019-12-18 21:25:30,052 INFO L226 Difference]: Without dead ends: 660 [2019-12-18 21:25:30,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-18 21:25:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-18 21:25:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:25:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-18 21:25:30,067 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-18 21:25:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:30,067 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-18 21:25:30,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-18 21:25:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:25:30,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:30,069 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] [2019-12-18 21:25:30,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:30,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-18 21:25:30,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:30,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289210598] [2019-12-18 21:25:30,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:30,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289210598] [2019-12-18 21:25:30,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:30,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:30,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758929615] [2019-12-18 21:25:30,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:30,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:30,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:30,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:30,185 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-18 21:25:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:30,381 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-18 21:25:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:25:30,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 21:25:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:30,383 INFO L225 Difference]: With dead ends: 875 [2019-12-18 21:25:30,383 INFO L226 Difference]: Without dead ends: 875 [2019-12-18 21:25:30,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-18 21:25:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-18 21:25:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-18 21:25:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-18 21:25:30,395 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-18 21:25:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:30,396 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-18 21:25:30,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-18 21:25:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:25:30,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:30,397 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] [2019-12-18 21:25:30,397 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-18 21:25:30,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:30,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686272794] [2019-12-18 21:25:30,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:30,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686272794] [2019-12-18 21:25:30,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:30,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:30,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680826359] [2019-12-18 21:25:30,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:30,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:30,535 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 3 states. [2019-12-18 21:25:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:30,550 INFO L93 Difference]: Finished difference Result 640 states and 1437 transitions. [2019-12-18 21:25:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:30,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:25:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:30,552 INFO L225 Difference]: With dead ends: 640 [2019-12-18 21:25:30,552 INFO L226 Difference]: Without dead ends: 640 [2019-12-18 21:25:30,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-18 21:25:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 604. [2019-12-18 21:25:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:25:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-18 21:25:30,563 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-18 21:25:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:30,564 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-18 21:25:30,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-18 21:25:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:30,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:30,565 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] [2019-12-18 21:25:30,565 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-18 21:25:30,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:30,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685526462] [2019-12-18 21:25:30,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:30,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685526462] [2019-12-18 21:25:30,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:30,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:25:30,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174875112] [2019-12-18 21:25:30,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:25:30,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:25:30,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:25:30,865 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 13 states. [2019-12-18 21:25:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:31,192 INFO L93 Difference]: Finished difference Result 856 states and 1886 transitions. [2019-12-18 21:25:31,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:25:31,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:25:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:31,193 INFO L225 Difference]: With dead ends: 856 [2019-12-18 21:25:31,193 INFO L226 Difference]: Without dead ends: 826 [2019-12-18 21:25:31,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:25:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-12-18 21:25:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 808. [2019-12-18 21:25:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-18 21:25:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1804 transitions. [2019-12-18 21:25:31,203 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1804 transitions. Word has length 57 [2019-12-18 21:25:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:31,203 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1804 transitions. [2019-12-18 21:25:31,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:25:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1804 transitions. [2019-12-18 21:25:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:31,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:31,205 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] [2019-12-18 21:25:31,205 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1924789388, now seen corresponding path program 2 times [2019-12-18 21:25:31,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:31,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20044767] [2019-12-18 21:25:31,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:31,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20044767] [2019-12-18 21:25:31,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:31,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:25:31,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882511329] [2019-12-18 21:25:31,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:25:31,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:31,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:25:31,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:25:31,465 INFO L87 Difference]: Start difference. First operand 808 states and 1804 transitions. Second operand 11 states. [2019-12-18 21:25:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:31,938 INFO L93 Difference]: Finished difference Result 1287 states and 2672 transitions. [2019-12-18 21:25:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:25:31,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-18 21:25:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:31,940 INFO L225 Difference]: With dead ends: 1287 [2019-12-18 21:25:31,940 INFO L226 Difference]: Without dead ends: 888 [2019-12-18 21:25:31,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:25:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-12-18 21:25:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 823. [2019-12-18 21:25:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-18 21:25:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1819 transitions. [2019-12-18 21:25:31,950 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1819 transitions. Word has length 57 [2019-12-18 21:25:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:31,951 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1819 transitions. [2019-12-18 21:25:31,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:25:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1819 transitions. [2019-12-18 21:25:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:31,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:31,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:31,953 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1127271004, now seen corresponding path program 3 times [2019-12-18 21:25:31,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:31,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29750356] [2019-12-18 21:25:31,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:32,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29750356] [2019-12-18 21:25:32,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:32,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:25:32,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788186055] [2019-12-18 21:25:32,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:25:32,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:32,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:25:32,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:25:32,194 INFO L87 Difference]: Start difference. First operand 823 states and 1819 transitions. Second operand 11 states. [2019-12-18 21:25:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:32,598 INFO L93 Difference]: Finished difference Result 1274 states and 2622 transitions. [2019-12-18 21:25:32,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:25:32,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-18 21:25:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:32,600 INFO L225 Difference]: With dead ends: 1274 [2019-12-18 21:25:32,601 INFO L226 Difference]: Without dead ends: 796 [2019-12-18 21:25:32,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:25:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-18 21:25:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 746. [2019-12-18 21:25:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-18 21:25:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1625 transitions. [2019-12-18 21:25:32,609 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1625 transitions. Word has length 57 [2019-12-18 21:25:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:32,609 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1625 transitions. [2019-12-18 21:25:32,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:25:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1625 transitions. [2019-12-18 21:25:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:32,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:32,611 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] [2019-12-18 21:25:32,611 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 4 times [2019-12-18 21:25:32,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:32,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693541817] [2019-12-18 21:25:32,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:32,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:25:32,740 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:25:32,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0) (= v_~a~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27| 1) |v_#valid_54|) (= v_~z~0_11 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1126~0.base_27| 4) |v_#length_19|) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27|) |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1126~0.base_27|) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_~#t1126~0.offset=|v_ULTIMATE.start_main_~#t1126~0.offset_21|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1126~0.base=|v_ULTIMATE.start_main_~#t1126~0.base_27|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1127~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1127~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1126~0.offset, 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, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1128~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_~#t1126~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1128~0.offset, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:25:32,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1127~0.base_9| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1127~0.base_9|) (= |v_ULTIMATE.start_main_~#t1127~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9|) |v_ULTIMATE.start_main_~#t1127~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1127~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1127~0.offset] because there is no mapped edge [2019-12-18 21:25:32,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1128~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1128~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1128~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10|) |v_ULTIMATE.start_main_~#t1128~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1128~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_10|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1128~0.base, ULTIMATE.start_main_~#t1128~0.offset] because there is no mapped edge [2019-12-18 21:25:32,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (= ~y$r_buff1_thd3~0_Out107519076 ~y$r_buff0_thd3~0_In107519076) (= 1 ~y$r_buff0_thd3~0_Out107519076) (= ~a~0_In107519076 ~__unbuffered_p2_EBX~0_Out107519076) (= ~y$r_buff0_thd1~0_In107519076 ~y$r_buff1_thd1~0_Out107519076) (= ~z~0_Out107519076 1) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In107519076)) (= ~y$r_buff1_thd0~0_Out107519076 ~y$r_buff0_thd0~0_In107519076) (= ~__unbuffered_p2_EAX~0_Out107519076 ~z~0_Out107519076) (= ~y$r_buff1_thd2~0_Out107519076 ~y$r_buff0_thd2~0_In107519076)) InVars {~a~0=~a~0_In107519076, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In107519076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In107519076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In107519076, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In107519076, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In107519076} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out107519076, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In107519076, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out107519076, ~a~0=~a~0_In107519076, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out107519076, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out107519076, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out107519076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In107519076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In107519076, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In107519076, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out107519076, ~z~0=~z~0_Out107519076, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out107519076} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:25:32,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:25:32,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In36342716 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In36342716 256))) (.cse1 (= |P1Thread1of1ForFork0_#t~ite4_Out36342716| |P1Thread1of1ForFork0_#t~ite3_Out36342716|))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In36342716 |P1Thread1of1ForFork0_#t~ite3_Out36342716|) (not .cse2)) (and (= ~y~0_In36342716 |P1Thread1of1ForFork0_#t~ite3_Out36342716|) (or .cse2 .cse0) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In36342716, ~y$w_buff1~0=~y$w_buff1~0_In36342716, ~y~0=~y~0_In36342716, ~y$w_buff1_used~0=~y$w_buff1_used~0_In36342716} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In36342716, ~y$w_buff1~0=~y$w_buff1~0_In36342716, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out36342716|, ~y~0=~y~0_In36342716, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out36342716|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In36342716} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:25:32,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1842109400 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1842109400 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-1842109400| ~y$w_buff0_used~0_In-1842109400)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-1842109400| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842109400, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1842109400} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842109400, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1842109400|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1842109400} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:25:32,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In153870408 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In153870408 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In153870408 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In153870408 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out153870408| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite12_Out153870408| ~y$w_buff1_used~0_In153870408) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In153870408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153870408, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In153870408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153870408} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In153870408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153870408, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In153870408, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out153870408|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153870408} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:25:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1546031327 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1546031327 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out1546031327 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1546031327 ~y$r_buff0_thd3~0_In1546031327)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1546031327, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1546031327} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1546031327|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1546031327, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1546031327} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:25:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In219722611 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In219722611 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In219722611 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In219722611 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite14_Out219722611| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite14_Out219722611| ~y$r_buff1_thd3~0_In219722611) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In219722611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In219722611, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In219722611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In219722611} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out219722611|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In219722611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In219722611, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In219722611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In219722611} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:25:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 21:25:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1313849631 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1313849631 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1313849631|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1313849631 |P1Thread1of1ForFork0_#t~ite5_Out1313849631|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1313849631, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1313849631} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1313849631, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1313849631, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1313849631|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:25:32,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In1540460292 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1540460292 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1540460292 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1540460292 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1540460292 |P1Thread1of1ForFork0_#t~ite6_Out1540460292|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out1540460292|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1540460292, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1540460292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1540460292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1540460292} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1540460292, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1540460292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1540460292, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1540460292|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1540460292} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:25:32,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-541637484 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-541637484 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-541637484|) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out-541637484| ~y$r_buff0_thd2~0_In-541637484) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-541637484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-541637484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-541637484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-541637484, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-541637484|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:25:32,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In632902507 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In632902507 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In632902507 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In632902507 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In632902507 |P1Thread1of1ForFork0_#t~ite8_Out632902507|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out632902507|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In632902507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In632902507, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In632902507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In632902507} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In632902507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In632902507, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In632902507, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out632902507|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In632902507} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:25:32,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 21:25:32,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:25:32,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2077753315 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out2077753315| |ULTIMATE.start_main_#t~ite19_Out2077753315|)) (.cse1 (= (mod ~y$w_buff1_used~0_In2077753315 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out2077753315| ~y~0_In2077753315)) (and (= ~y$w_buff1~0_In2077753315 |ULTIMATE.start_main_#t~ite18_Out2077753315|) (not .cse0) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2077753315, ~y~0=~y~0_In2077753315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2077753315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2077753315} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2077753315, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2077753315|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2077753315|, ~y~0=~y~0_In2077753315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2077753315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2077753315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:25:32,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1163546909 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1163546909 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1163546909| ~y$w_buff0_used~0_In1163546909) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out1163546909| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1163546909, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1163546909} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1163546909, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1163546909, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1163546909|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:25:32,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In339973772 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In339973772 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In339973772 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In339973772 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out339973772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In339973772 |ULTIMATE.start_main_#t~ite21_Out339973772|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In339973772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In339973772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In339973772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339973772} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In339973772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In339973772, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out339973772|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In339973772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339973772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:25:32,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1381031110 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1381031110 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out1381031110| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out1381031110| ~y$r_buff0_thd0~0_In1381031110) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1381031110, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1381031110} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1381031110, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1381031110, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1381031110|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:25:32,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In414910441 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In414910441 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In414910441 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In414910441 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out414910441| ~y$r_buff1_thd0~0_In414910441) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite23_Out414910441| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In414910441, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In414910441, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In414910441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In414910441} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In414910441, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In414910441, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In414910441, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out414910441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In414910441} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:25:32,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In929551231 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In929551231| |ULTIMATE.start_main_#t~ite29_Out929551231|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out929551231| ~y$w_buff0~0_In929551231)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In929551231 256)))) (or (= (mod ~y$w_buff0_used~0_In929551231 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In929551231 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In929551231 256))))) (= |ULTIMATE.start_main_#t~ite30_Out929551231| |ULTIMATE.start_main_#t~ite29_Out929551231|) .cse0 (= ~y$w_buff0~0_In929551231 |ULTIMATE.start_main_#t~ite29_Out929551231|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In929551231, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In929551231|, ~y$w_buff0~0=~y$w_buff0~0_In929551231, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In929551231, ~weak$$choice2~0=~weak$$choice2~0_In929551231, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In929551231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In929551231} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out929551231|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In929551231, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out929551231|, ~y$w_buff0~0=~y$w_buff0~0_In929551231, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In929551231, ~weak$$choice2~0=~weak$$choice2~0_In929551231, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In929551231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In929551231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 21:25:32,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In750967914 256) 0))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In750967914 |ULTIMATE.start_main_#t~ite36_Out750967914|) (= |ULTIMATE.start_main_#t~ite35_In750967914| |ULTIMATE.start_main_#t~ite35_Out750967914|)) (and (= |ULTIMATE.start_main_#t~ite36_Out750967914| |ULTIMATE.start_main_#t~ite35_Out750967914|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In750967914 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In750967914 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In750967914 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In750967914 256))))) (= ~y$w_buff0_used~0_In750967914 |ULTIMATE.start_main_#t~ite35_Out750967914|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In750967914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In750967914, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In750967914|, ~weak$$choice2~0=~weak$$choice2~0_In750967914, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In750967914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In750967914} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In750967914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In750967914, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out750967914|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out750967914|, ~weak$$choice2~0=~weak$$choice2~0_In750967914, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In750967914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In750967914} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:25:32,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1198886158 256)))) (or (and .cse0 (= ~y$w_buff1_used~0_In-1198886158 |ULTIMATE.start_main_#t~ite38_Out-1198886158|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1198886158 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In-1198886158 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1198886158 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1198886158 256) 0)))) (= |ULTIMATE.start_main_#t~ite39_Out-1198886158| |ULTIMATE.start_main_#t~ite38_Out-1198886158|)) (and (= |ULTIMATE.start_main_#t~ite38_In-1198886158| |ULTIMATE.start_main_#t~ite38_Out-1198886158|) (not .cse0) (= ~y$w_buff1_used~0_In-1198886158 |ULTIMATE.start_main_#t~ite39_Out-1198886158|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198886158, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198886158, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1198886158|, ~weak$$choice2~0=~weak$$choice2~0_In-1198886158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198886158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198886158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198886158, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1198886158|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198886158, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1198886158|, ~weak$$choice2~0=~weak$$choice2~0_In-1198886158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198886158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198886158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:25:32,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:25:32,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse3 (= |ULTIMATE.start_main_#t~ite45_Out764207991| |ULTIMATE.start_main_#t~ite44_Out764207991|)) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In764207991 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In764207991 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In764207991 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd0~0_In764207991 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In764207991 256) 0))) (or (let ((.cse1 (not .cse6))) (and .cse0 (= |ULTIMATE.start_main_#t~ite44_Out764207991| |ULTIMATE.start_main_#t~ite43_Out764207991|) (or .cse1 (not .cse2)) (= 0 |ULTIMATE.start_main_#t~ite43_Out764207991|) .cse3 (or (not .cse4) .cse1) (not .cse5))) (and (= |ULTIMATE.start_main_#t~ite43_In764207991| |ULTIMATE.start_main_#t~ite43_Out764207991|) (or (and .cse0 .cse3 (or .cse5 (and .cse6 .cse2) (and .cse6 .cse4)) (= ~y$r_buff1_thd0~0_In764207991 |ULTIMATE.start_main_#t~ite44_Out764207991|)) (and (= |ULTIMATE.start_main_#t~ite44_Out764207991| |ULTIMATE.start_main_#t~ite44_In764207991|) (= ~y$r_buff1_thd0~0_In764207991 |ULTIMATE.start_main_#t~ite45_Out764207991|) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In764207991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In764207991, ~weak$$choice2~0=~weak$$choice2~0_In764207991, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In764207991|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In764207991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In764207991, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In764207991|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In764207991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In764207991, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out764207991|, ~weak$$choice2~0=~weak$$choice2~0_In764207991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In764207991, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out764207991|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out764207991|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In764207991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:25:32,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:25:32,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:25:32,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:25:32 BasicIcfg [2019-12-18 21:25:32,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:25:32,877 INFO L168 Benchmark]: Toolchain (without parser) took 25312.89 ms. Allocated memory was 146.3 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 103.2 MB in the beginning and 631.9 MB in the end (delta: -528.7 MB). Peak memory consumption was 520.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:32,879 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:25:32,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.08 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 158.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:32,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.82 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:32,882 INFO L168 Benchmark]: Boogie Preprocessor took 35.86 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:32,882 INFO L168 Benchmark]: RCFGBuilder took 834.69 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 105.6 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:32,887 INFO L168 Benchmark]: TraceAbstraction took 23597.77 ms. Allocated memory was 204.5 MB in the beginning and 1.2 GB in the end (delta: 991.4 MB). Free memory was 105.0 MB in the beginning and 631.9 MB in the end (delta: -526.9 MB). Peak memory consumption was 464.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:32,892 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.08 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 158.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.82 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.86 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.69 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 105.6 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23597.77 ms. Allocated memory was 204.5 MB in the beginning and 1.2 GB in the end (delta: 991.4 MB). Free memory was 105.0 MB in the beginning and 631.9 MB in the end (delta: -526.9 MB). Peak memory consumption was 464.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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, z=0] [L814] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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, z=0] [L816] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, 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, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=1, 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, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=1, 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, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L833] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L833] 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) [L834] 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)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L835] 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)) [L836] 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)) [L837] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2012 SDtfs, 2445 SDslu, 4943 SDs, 0 SdLazy, 2668 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30668occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 35283 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 591 ConstructedInterpolants, 0 QuantifiedInterpolants, 130135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...