/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/rfi001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:59:39,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:59:39,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:59:39,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:59:39,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:59:39,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:59:39,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:59:39,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:59:39,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:59:39,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:59:39,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:59:39,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:59:39,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:59:39,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:59:39,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:59:39,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:59:39,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:59:39,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:59:39,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:59:39,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:59:39,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:59:39,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:59:39,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:59:39,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:59:39,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:59:39,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:59:39,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:59:39,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:59:39,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:59:39,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:59:39,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:59:39,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:59:39,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:59:39,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:59:39,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:59:39,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:59:39,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:59:39,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:59:39,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:59:39,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:59:39,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:59:39,292 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:59:39,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:59:39,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:59:39,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:59:39,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:59:39,308 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:59:39,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:59:39,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:59:39,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:59:39,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:59:39,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:59:39,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:59:39,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:59:39,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:59:39,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:59:39,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:59:39,311 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:59:39,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:59:39,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:59:39,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:59:39,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:59:39,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:59:39,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:59:39,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:59:39,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:59:39,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:59:39,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:59:39,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:59:39,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:59:39,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:59:39,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:59:39,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:59:39,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:59:39,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:59:39,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:59:39,642 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:59:39,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2019-12-18 21:59:39,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069372568/8cfac045212c433ab777e990c746a9eb/FLAG4744d43fc [2019-12-18 21:59:40,216 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:59:40,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2019-12-18 21:59:40,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069372568/8cfac045212c433ab777e990c746a9eb/FLAG4744d43fc [2019-12-18 21:59:40,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069372568/8cfac045212c433ab777e990c746a9eb [2019-12-18 21:59:40,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:59:40,530 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:59:40,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:40,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:59:40,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:59:40,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:40" (1/1) ... [2019-12-18 21:59:40,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49494e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:40, skipping insertion in model container [2019-12-18 21:59:40,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:59:40" (1/1) ... [2019-12-18 21:59:40,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:59:40,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:59:41,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:41,169 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:59:41,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:59:41,324 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:59:41,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41 WrapperNode [2019-12-18 21:59:41,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:59:41,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:41,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:59:41,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:59:41,335 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:59:41" (1/1) ... [2019-12-18 21:59:41,355 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:59:41" (1/1) ... [2019-12-18 21:59:41,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:59:41,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:59:41,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:59:41,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:59:41,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (1/1) ... [2019-12-18 21:59:41,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:59:41,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:59:41,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:59:41,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:59:41,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (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:59:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:59:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:59:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:59:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:59:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:59:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:59:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:59:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:59:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:59:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:59:41,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:59:41,507 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:59:42,273 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:59:42,273 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:59:42,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:42 BoogieIcfgContainer [2019-12-18 21:59:42,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:59:42,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:59:42,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:59:42,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:59:42,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:59:40" (1/3) ... [2019-12-18 21:59:42,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d43bd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:42, skipping insertion in model container [2019-12-18 21:59:42,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:59:41" (2/3) ... [2019-12-18 21:59:42,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d43bd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:59:42, skipping insertion in model container [2019-12-18 21:59:42,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:59:42" (3/3) ... [2019-12-18 21:59:42,283 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt.i [2019-12-18 21:59:42,293 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:59:42,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:59:42,300 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:59:42,301 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:59:42,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,359 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:59:42,381 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:59:42,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:59:42,400 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:59:42,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:59:42,401 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:59:42,401 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:59:42,401 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:59:42,401 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:59:42,402 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:59:42,419 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 21:59:42,421 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:59:42,519 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:59:42,520 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:42,534 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:59:42,553 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:59:42,626 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:59:42,626 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:59:42,634 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:59:42,652 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 21:59:42,653 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:59:45,622 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:59:45,730 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:59:45,749 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49437 [2019-12-18 21:59:45,749 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 21:59:45,753 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-18 21:59:46,259 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9388 states. [2019-12-18 21:59:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states. [2019-12-18 21:59:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:59:46,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:46,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:59:46,270 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash 694837997, now seen corresponding path program 1 times [2019-12-18 21:59:46,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:46,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790742224] [2019-12-18 21:59:46,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:46,526 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:59:46,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790742224] [2019-12-18 21:59:46,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:46,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:59:46,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816489892] [2019-12-18 21:59:46,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:46,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:46,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:46,546 INFO L87 Difference]: Start difference. First operand 9388 states. Second operand 3 states. [2019-12-18 21:59:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:46,920 INFO L93 Difference]: Finished difference Result 9298 states and 30527 transitions. [2019-12-18 21:59:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:46,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:59:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:47,014 INFO L225 Difference]: With dead ends: 9298 [2019-12-18 21:59:47,015 INFO L226 Difference]: Without dead ends: 9116 [2019-12-18 21:59:47,016 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:59:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2019-12-18 21:59:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 9116. [2019-12-18 21:59:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2019-12-18 21:59:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 29968 transitions. [2019-12-18 21:59:47,458 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 29968 transitions. Word has length 5 [2019-12-18 21:59:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:47,459 INFO L462 AbstractCegarLoop]: Abstraction has 9116 states and 29968 transitions. [2019-12-18 21:59:47,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 29968 transitions. [2019-12-18 21:59:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:59:47,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:47,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:47,462 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash -869232034, now seen corresponding path program 1 times [2019-12-18 21:59:47,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:47,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992537974] [2019-12-18 21:59:47,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:47,569 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:59:47,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992537974] [2019-12-18 21:59:47,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:47,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:47,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649161831] [2019-12-18 21:59:47,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:47,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:47,575 INFO L87 Difference]: Start difference. First operand 9116 states and 29968 transitions. Second operand 4 states. [2019-12-18 21:59:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:48,190 INFO L93 Difference]: Finished difference Result 14491 states and 45326 transitions. [2019-12-18 21:59:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:48,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:59:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:48,316 INFO L225 Difference]: With dead ends: 14491 [2019-12-18 21:59:48,316 INFO L226 Difference]: Without dead ends: 14484 [2019-12-18 21:59:48,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-12-18 21:59:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 13090. [2019-12-18 21:59:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-18 21:59:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41590 transitions. [2019-12-18 21:59:49,702 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41590 transitions. Word has length 11 [2019-12-18 21:59:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:49,702 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41590 transitions. [2019-12-18 21:59:49,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41590 transitions. [2019-12-18 21:59:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:59:49,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:49,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:49,705 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash 256873832, now seen corresponding path program 1 times [2019-12-18 21:59:49,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:49,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649316945] [2019-12-18 21:59:49,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:49,812 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:59:49,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649316945] [2019-12-18 21:59:49,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:49,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:49,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168926966] [2019-12-18 21:59:49,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:49,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:49,816 INFO L87 Difference]: Start difference. First operand 13090 states and 41590 transitions. Second operand 4 states. [2019-12-18 21:59:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:50,060 INFO L93 Difference]: Finished difference Result 15862 states and 50069 transitions. [2019-12-18 21:59:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:50,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:59:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:50,112 INFO L225 Difference]: With dead ends: 15862 [2019-12-18 21:59:50,112 INFO L226 Difference]: Without dead ends: 15862 [2019-12-18 21:59:50,112 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:59:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15862 states. [2019-12-18 21:59:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15862 to 14086. [2019-12-18 21:59:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14086 states. [2019-12-18 21:59:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 44814 transitions. [2019-12-18 21:59:50,696 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 44814 transitions. Word has length 11 [2019-12-18 21:59:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:50,696 INFO L462 AbstractCegarLoop]: Abstraction has 14086 states and 44814 transitions. [2019-12-18 21:59:50,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 44814 transitions. [2019-12-18 21:59:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:59:50,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:50,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:50,702 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash -955684775, now seen corresponding path program 1 times [2019-12-18 21:59:50,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:50,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523482752] [2019-12-18 21:59:50,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:50,771 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:59:50,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523482752] [2019-12-18 21:59:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045107013] [2019-12-18 21:59:50,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:50,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:50,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:50,776 INFO L87 Difference]: Start difference. First operand 14086 states and 44814 transitions. Second operand 5 states. [2019-12-18 21:59:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:51,257 INFO L93 Difference]: Finished difference Result 18942 states and 58832 transitions. [2019-12-18 21:59:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:59:51,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:59:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:51,347 INFO L225 Difference]: With dead ends: 18942 [2019-12-18 21:59:51,348 INFO L226 Difference]: Without dead ends: 18935 [2019-12-18 21:59:51,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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:59:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18935 states. [2019-12-18 21:59:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18935 to 13974. [2019-12-18 21:59:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13974 states. [2019-12-18 21:59:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 44317 transitions. [2019-12-18 21:59:51,951 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 44317 transitions. Word has length 17 [2019-12-18 21:59:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:51,951 INFO L462 AbstractCegarLoop]: Abstraction has 13974 states and 44317 transitions. [2019-12-18 21:59:51,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 44317 transitions. [2019-12-18 21:59:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:59:51,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:51,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:51,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:51,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:51,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1822059607, now seen corresponding path program 1 times [2019-12-18 21:59:51,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:51,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355612178] [2019-12-18 21:59:51,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:52,008 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:59:52,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355612178] [2019-12-18 21:59:52,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:52,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:52,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477456509] [2019-12-18 21:59:52,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:52,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:52,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:52,010 INFO L87 Difference]: Start difference. First operand 13974 states and 44317 transitions. Second operand 3 states. [2019-12-18 21:59:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:52,129 INFO L93 Difference]: Finished difference Result 17027 states and 54294 transitions. [2019-12-18 21:59:52,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:52,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 21:59:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:52,156 INFO L225 Difference]: With dead ends: 17027 [2019-12-18 21:59:52,157 INFO L226 Difference]: Without dead ends: 17027 [2019-12-18 21:59:52,157 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:59:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17027 states. [2019-12-18 21:59:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17027 to 16072. [2019-12-18 21:59:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2019-12-18 21:59:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 51443 transitions. [2019-12-18 21:59:53,568 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 51443 transitions. Word has length 25 [2019-12-18 21:59:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:53,570 INFO L462 AbstractCegarLoop]: Abstraction has 16072 states and 51443 transitions. [2019-12-18 21:59:53,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 51443 transitions. [2019-12-18 21:59:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:59:53,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:53,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:53,592 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1659519911, now seen corresponding path program 1 times [2019-12-18 21:59:53,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:53,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499628402] [2019-12-18 21:59:53,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:53,697 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:59:53,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499628402] [2019-12-18 21:59:53,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:53,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:53,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137672421] [2019-12-18 21:59:53,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:53,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:53,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:53,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:53,700 INFO L87 Difference]: Start difference. First operand 16072 states and 51443 transitions. Second operand 4 states. [2019-12-18 21:59:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:53,746 INFO L93 Difference]: Finished difference Result 2493 states and 5802 transitions. [2019-12-18 21:59:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:59:53,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:59:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:53,751 INFO L225 Difference]: With dead ends: 2493 [2019-12-18 21:59:53,751 INFO L226 Difference]: Without dead ends: 2207 [2019-12-18 21:59:53,752 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:59:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-12-18 21:59:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-12-18 21:59:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-12-18 21:59:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 5011 transitions. [2019-12-18 21:59:53,804 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 5011 transitions. Word has length 25 [2019-12-18 21:59:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:53,804 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 5011 transitions. [2019-12-18 21:59:53,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 5011 transitions. [2019-12-18 21:59:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:59:53,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:53,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:53,809 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1180281911, now seen corresponding path program 1 times [2019-12-18 21:59:53,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:53,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740644789] [2019-12-18 21:59:53,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:53,896 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:59:53,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740644789] [2019-12-18 21:59:53,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:53,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:53,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897281286] [2019-12-18 21:59:53,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:53,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:53,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:53,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:53,899 INFO L87 Difference]: Start difference. First operand 2207 states and 5011 transitions. Second operand 5 states. [2019-12-18 21:59:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:53,942 INFO L93 Difference]: Finished difference Result 431 states and 787 transitions. [2019-12-18 21:59:53,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:53,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 21:59:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:53,944 INFO L225 Difference]: With dead ends: 431 [2019-12-18 21:59:53,944 INFO L226 Difference]: Without dead ends: 385 [2019-12-18 21:59:53,944 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:59:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-18 21:59:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 350. [2019-12-18 21:59:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-18 21:59:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 632 transitions. [2019-12-18 21:59:53,950 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 632 transitions. Word has length 37 [2019-12-18 21:59:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:53,950 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 632 transitions. [2019-12-18 21:59:53,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2019-12-18 21:59:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:59:53,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:53,953 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] [2019-12-18 21:59:53,953 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:53,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1601104520, now seen corresponding path program 1 times [2019-12-18 21:59:53,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:53,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847730642] [2019-12-18 21:59:53,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:54,049 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:59:54,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847730642] [2019-12-18 21:59:54,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:54,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:54,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547913758] [2019-12-18 21:59:54,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:54,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:54,052 INFO L87 Difference]: Start difference. First operand 350 states and 632 transitions. Second operand 3 states. [2019-12-18 21:59:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:54,064 INFO L93 Difference]: Finished difference Result 350 states and 619 transitions. [2019-12-18 21:59:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:54,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:59:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:54,065 INFO L225 Difference]: With dead ends: 350 [2019-12-18 21:59:54,065 INFO L226 Difference]: Without dead ends: 350 [2019-12-18 21:59:54,065 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:59:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-18 21:59:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-18 21:59:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-18 21:59:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 619 transitions. [2019-12-18 21:59:54,072 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 619 transitions. Word has length 52 [2019-12-18 21:59:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:54,072 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 619 transitions. [2019-12-18 21:59:54,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 619 transitions. [2019-12-18 21:59:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:59:54,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:54,075 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] [2019-12-18 21:59:54,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1092657509, now seen corresponding path program 1 times [2019-12-18 21:59:54,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:54,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48446925] [2019-12-18 21:59:54,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:54,319 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:59:54,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48446925] [2019-12-18 21:59:54,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:54,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:54,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209524256] [2019-12-18 21:59:54,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:59:54,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:54,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:59:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:59:54,325 INFO L87 Difference]: Start difference. First operand 350 states and 619 transitions. Second operand 9 states. [2019-12-18 21:59:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:54,932 INFO L93 Difference]: Finished difference Result 588 states and 1027 transitions. [2019-12-18 21:59:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:59:54,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 21:59:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:54,934 INFO L225 Difference]: With dead ends: 588 [2019-12-18 21:59:54,935 INFO L226 Difference]: Without dead ends: 588 [2019-12-18 21:59:54,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:59:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-12-18 21:59:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 438. [2019-12-18 21:59:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-18 21:59:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 774 transitions. [2019-12-18 21:59:54,944 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 774 transitions. Word has length 53 [2019-12-18 21:59:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:54,944 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 774 transitions. [2019-12-18 21:59:54,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:59:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 774 transitions. [2019-12-18 21:59:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:59:54,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:54,947 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] [2019-12-18 21:59:54,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1194206821, now seen corresponding path program 2 times [2019-12-18 21:59:54,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:54,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95545150] [2019-12-18 21:59:54,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:55,007 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:59:55,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95545150] [2019-12-18 21:59:55,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:55,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:55,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807588834] [2019-12-18 21:59:55,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:55,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:55,009 INFO L87 Difference]: Start difference. First operand 438 states and 774 transitions. Second operand 3 states. [2019-12-18 21:59:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:55,046 INFO L93 Difference]: Finished difference Result 437 states and 772 transitions. [2019-12-18 21:59:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:55,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:59:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:55,047 INFO L225 Difference]: With dead ends: 437 [2019-12-18 21:59:55,047 INFO L226 Difference]: Without dead ends: 437 [2019-12-18 21:59:55,048 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:59:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-18 21:59:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 349. [2019-12-18 21:59:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-18 21:59:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 608 transitions. [2019-12-18 21:59:55,053 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 608 transitions. Word has length 53 [2019-12-18 21:59:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:55,054 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 608 transitions. [2019-12-18 21:59:55,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 608 transitions. [2019-12-18 21:59:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:59:55,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:55,055 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] [2019-12-18 21:59:55,056 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 36779083, now seen corresponding path program 1 times [2019-12-18 21:59:55,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:55,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818346052] [2019-12-18 21:59:55,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:55,356 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:59:55,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818346052] [2019-12-18 21:59:55,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:55,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:59:55,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033469689] [2019-12-18 21:59:55,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:59:55,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:59:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:59:55,359 INFO L87 Difference]: Start difference. First operand 349 states and 608 transitions. Second operand 13 states. [2019-12-18 21:59:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:55,972 INFO L93 Difference]: Finished difference Result 684 states and 1210 transitions. [2019-12-18 21:59:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:59:55,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 21:59:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:55,974 INFO L225 Difference]: With dead ends: 684 [2019-12-18 21:59:55,974 INFO L226 Difference]: Without dead ends: 296 [2019-12-18 21:59:55,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:59:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-18 21:59:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 267. [2019-12-18 21:59:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-18 21:59:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 458 transitions. [2019-12-18 21:59:55,979 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 458 transitions. Word has length 54 [2019-12-18 21:59:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:55,980 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 458 transitions. [2019-12-18 21:59:55,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:59:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 458 transitions. [2019-12-18 21:59:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:59:55,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:55,981 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] [2019-12-18 21:59:55,981 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash -853828981, now seen corresponding path program 2 times [2019-12-18 21:59:55,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:55,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879881442] [2019-12-18 21:59:55,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:56,155 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:59:56,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879881442] [2019-12-18 21:59:56,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:56,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:59:56,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77216865] [2019-12-18 21:59:56,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:56,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:56,157 INFO L87 Difference]: Start difference. First operand 267 states and 458 transitions. Second operand 10 states. [2019-12-18 21:59:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:56,399 INFO L93 Difference]: Finished difference Result 385 states and 641 transitions. [2019-12-18 21:59:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:59:56,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-18 21:59:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:56,400 INFO L225 Difference]: With dead ends: 385 [2019-12-18 21:59:56,401 INFO L226 Difference]: Without dead ends: 222 [2019-12-18 21:59:56,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:59:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-18 21:59:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-18 21:59:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-18 21:59:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 342 transitions. [2019-12-18 21:59:56,406 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 342 transitions. Word has length 54 [2019-12-18 21:59:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:56,406 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 342 transitions. [2019-12-18 21:59:56,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 342 transitions. [2019-12-18 21:59:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:59:56,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:56,408 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] [2019-12-18 21:59:56,408 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -655778997, now seen corresponding path program 3 times [2019-12-18 21:59:56,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:56,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584098649] [2019-12-18 21:59:56,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:59:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:59:56,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:59:56,518 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:59:56,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1615~0.base_19|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1615~0.base_19|) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd1~0_19 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t1615~0.offset_14| 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~y$r_buff1_thd0~0_46) (= v_~y$mem_tmp~0_11 0) (= v_~y~0_28 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd0~0_78 0) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$w_buff0_used~0_106 0) (= |v_#NULL.offset_5| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1615~0.base_19| 4)) (= 0 v_~z~0_9) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1615~0.base_19| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1615~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1615~0.base_19|) |v_ULTIMATE.start_main_~#t1615~0.offset_14| 0)) |v_#memory_int_15|) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1615~0.offset=|v_ULTIMATE.start_main_~#t1615~0.offset_14|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_19, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_~#t1615~0.base=|v_ULTIMATE.start_main_~#t1615~0.base_19|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_~#t1616~0.offset=|v_ULTIMATE.start_main_~#t1616~0.offset_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, 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_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_46, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ULTIMATE.start_main_~#t1616~0.base=|v_ULTIMATE.start_main_~#t1616~0.base_16|, ~y~0=v_~y~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #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, ULTIMATE.start_main_~#t1615~0.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1615~0.base, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1616~0.offset, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, 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, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ULTIMATE.start_main_~#t1616~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, 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:59:56,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L789-1-->L791: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1616~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t1616~0.offset_10| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1616~0.base_11| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1616~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1616~0.base_11|) |v_ULTIMATE.start_main_~#t1616~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1616~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1616~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1616~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1616~0.offset=|v_ULTIMATE.start_main_~#t1616~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1616~0.base=|v_ULTIMATE.start_main_~#t1616~0.base_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1616~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1616~0.base, #length] because there is no mapped edge [2019-12-18 21:59:56,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0_used~0_73) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= 2 v_~y$w_buff0~0_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:59:56,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-449511682 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-449511682 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-449511682| |P0Thread1of1ForFork0_#t~ite3_Out-449511682|))) (or (and (= ~y$w_buff1~0_In-449511682 |P0Thread1of1ForFork0_#t~ite3_Out-449511682|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~y~0_In-449511682 |P0Thread1of1ForFork0_#t~ite3_Out-449511682|) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-449511682, ~y$w_buff1~0=~y$w_buff1~0_In-449511682, ~y~0=~y~0_In-449511682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-449511682} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-449511682, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-449511682|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-449511682|, ~y$w_buff1~0=~y$w_buff1~0_In-449511682, ~y~0=~y~0_In-449511682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-449511682} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:59:56,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In179174026 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In179174026 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out179174026| ~y$w_buff0_used~0_In179174026) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out179174026| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In179174026, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In179174026} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out179174026|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179174026, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In179174026} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:59:56,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1246985043 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1246985043 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1246985043 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1246985043 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1246985043| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1246985043| ~y$w_buff1_used~0_In-1246985043) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1246985043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1246985043, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1246985043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1246985043} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1246985043|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1246985043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1246985043, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1246985043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1246985043} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:59:56,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1369496605 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1369496605 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1369496605| ~y$r_buff0_thd1~0_In-1369496605)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-1369496605| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1369496605, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1369496605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1369496605, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1369496605|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1369496605} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:59:56,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-342498462 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-342498462 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-342498462 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-342498462 256)))) (or (and (= ~y$r_buff1_thd1~0_In-342498462 |P0Thread1of1ForFork0_#t~ite8_Out-342498462|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-342498462|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-342498462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-342498462, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-342498462, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-342498462} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-342498462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-342498462, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-342498462|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-342498462, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-342498462} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:59:56,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:59:56,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In778856465 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In778856465 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out778856465| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out778856465| ~y$w_buff0_used~0_In778856465)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In778856465, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In778856465} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In778856465, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In778856465, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out778856465|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:59:56,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1082615374 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1082615374 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1082615374 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1082615374 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1082615374| 0)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1082615374 |P1Thread1of1ForFork1_#t~ite12_Out-1082615374|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1082615374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082615374, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1082615374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1082615374} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1082615374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082615374, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1082615374, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1082615374|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1082615374} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:59:56,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1833576337 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1833576337 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-1833576337 ~y$r_buff0_thd2~0_In-1833576337)) (and (= ~y$r_buff0_thd2~0_Out-1833576337 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1833576337, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1833576337} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1833576337, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1833576337, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1833576337|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 21:59:56,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In755844143 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In755844143 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In755844143 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In755844143 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out755844143| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out755844143| ~y$r_buff1_thd2~0_In755844143) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In755844143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In755844143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In755844143, ~y$w_buff1_used~0=~y$w_buff1_used~0_In755844143} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In755844143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In755844143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In755844143, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out755844143|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In755844143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:59:56,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:59:56,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= 0 (mod v_~y$w_buff0_used~0_94 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:59:56,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1088051873 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1088051873 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-1088051873| ~y~0_In-1088051873)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-1088051873| ~y$w_buff1~0_In-1088051873)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1088051873, ~y~0=~y~0_In-1088051873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1088051873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088051873} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1088051873|, ~y$w_buff1~0=~y$w_buff1~0_In-1088051873, ~y~0=~y~0_In-1088051873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1088051873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088051873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 21:59:56,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 21:59:56,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-786607681 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-786607681 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-786607681| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-786607681 |ULTIMATE.start_main_#t~ite19_Out-786607681|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-786607681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-786607681} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-786607681, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-786607681|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-786607681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:59:56,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1843699384 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1843699384 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1843699384 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1843699384 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1843699384| ~y$w_buff1_used~0_In1843699384) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite20_Out1843699384| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1843699384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1843699384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1843699384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843699384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1843699384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1843699384, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1843699384|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1843699384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1843699384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:59:56,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1578175411 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1578175411 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1578175411|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1578175411 |ULTIMATE.start_main_#t~ite21_Out-1578175411|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1578175411, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1578175411} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1578175411, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1578175411, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1578175411|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:59:56,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1163960177 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1163960177 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1163960177 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1163960177 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1163960177|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out1163960177| ~y$r_buff1_thd0~0_In1163960177) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1163960177, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1163960177, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1163960177, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1163960177} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1163960177, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1163960177, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1163960177, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1163960177|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1163960177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:59:56,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-739722302 256)))) (or (and (= ~y$w_buff1_used~0_In-739722302 |ULTIMATE.start_main_#t~ite37_Out-739722302|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-739722302 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-739722302 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-739722302 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-739722302 256))))) .cse1 (= |ULTIMATE.start_main_#t~ite37_Out-739722302| |ULTIMATE.start_main_#t~ite38_Out-739722302|)) (and (= |ULTIMATE.start_main_#t~ite37_In-739722302| |ULTIMATE.start_main_#t~ite37_Out-739722302|) (not .cse1) (= ~y$w_buff1_used~0_In-739722302 |ULTIMATE.start_main_#t~ite38_Out-739722302|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-739722302, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-739722302, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-739722302|, ~weak$$choice2~0=~weak$$choice2~0_In-739722302, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-739722302, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-739722302} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-739722302, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-739722302, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-739722302|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-739722302|, ~weak$$choice2~0=~weak$$choice2~0_In-739722302, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-739722302, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-739722302} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:59:56,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_20 256))) (= v_~y$r_buff0_thd0~0_56 v_~y$r_buff0_thd0~0_55)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 21:59:56,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L816-->L819-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:59:56,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:59:56,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:59:56 BasicIcfg [2019-12-18 21:59:56,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:59:56,608 INFO L168 Benchmark]: Toolchain (without parser) took 16078.24 ms. Allocated memory was 137.4 MB in the beginning and 790.6 MB in the end (delta: 653.3 MB). Free memory was 100.2 MB in the beginning and 520.9 MB in the end (delta: -420.7 MB). Peak memory consumption was 232.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:56,609 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:59:56,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.12 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 155.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:56,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.81 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:56,611 INFO L168 Benchmark]: Boogie Preprocessor took 37.01 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:56,611 INFO L168 Benchmark]: RCFGBuilder took 832.51 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 104.9 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:56,612 INFO L168 Benchmark]: TraceAbstraction took 14330.46 ms. Allocated memory was 201.3 MB in the beginning and 790.6 MB in the end (delta: 589.3 MB). Free memory was 104.9 MB in the beginning and 520.9 MB in the end (delta: -416.0 MB). Peak memory consumption was 173.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:59:56,616 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.20 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.12 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 155.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.81 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.01 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.51 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 104.9 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14330.46 ms. Allocated memory was 201.3 MB in the beginning and 790.6 MB in the end (delta: 589.3 MB). Free memory was 104.9 MB in the beginning and 520.9 MB in the end (delta: -416.0 MB). Peak memory consumption was 173.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 148 ProgramPointsBefore, 81 ProgramPointsAfterwards, 182 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3553 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49437 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 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) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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 [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 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) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 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)) [L810] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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)) [L811] EXPR 0 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 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)) [L812] 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)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 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)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1346 SDtfs, 1498 SDslu, 2806 SDs, 0 SdLazy, 1582 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16072occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 9412 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 71202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...