/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:39:32,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:39:32,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:39:32,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:39:32,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:39:32,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:39:32,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:39:32,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:39:32,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:39:32,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:39:32,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:39:32,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:39:32,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:39:32,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:39:32,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:39:32,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:39:32,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:39:32,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:39:32,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:39:32,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:39:32,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:39:32,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:39:32,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:39:32,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:39:32,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:39:32,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:39:32,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:39:32,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:39:32,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:39:32,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:39:32,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:39:32,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:39:32,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:39:32,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:39:32,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:39:32,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:39:32,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:39:32,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:39:32,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:39:32,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:39:32,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:39:32,358 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-MCR.epf [2019-12-27 21:39:32,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:39:32,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:39:32,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:39:32,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:39:32,379 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:39:32,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:39:32,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:39:32,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:39:32,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:39:32,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:39:32,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:39:32,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:39:32,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:39:32,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:39:32,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:39:32,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:39:32,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:39:32,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:39:32,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:39:32,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:39:32,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:39:32,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:39:32,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:39:32,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:39:32,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:39:32,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:39:32,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:39:32,384 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:39:32,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:39:32,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:39:32,384 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:39:32,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:39:32,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:39:32,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:39:32,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:39:32,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:39:32,698 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:39:32,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-27 21:39:32,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe385518b/a42ce644d9ba43e3b9c764008b0d6026/FLAGe65acb719 [2019-12-27 21:39:33,358 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:39:33,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-27 21:39:33,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe385518b/a42ce644d9ba43e3b9c764008b0d6026/FLAGe65acb719 [2019-12-27 21:39:33,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe385518b/a42ce644d9ba43e3b9c764008b0d6026 [2019-12-27 21:39:33,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:39:33,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:39:33,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:33,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:39:33,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:39:33,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:33" (1/1) ... [2019-12-27 21:39:33,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:33, skipping insertion in model container [2019-12-27 21:39:33,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:33" (1/1) ... [2019-12-27 21:39:33,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:39:33,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:39:34,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:34,186 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:39:34,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:34,340 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:39:34,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34 WrapperNode [2019-12-27 21:39:34,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:34,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:34,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:39:34,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:39:34,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:34,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:39:34,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:39:34,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:39:34,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... [2019-12-27 21:39:34,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:39:34,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:39:34,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:39:34,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:39:34,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:39:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:39:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:39:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:39:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:39:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:39:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:39:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:39:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:39:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:39:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:39:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:39:34,553 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:39:35,260 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:39:35,261 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:39:35,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:35 BoogieIcfgContainer [2019-12-27 21:39:35,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:39:35,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:39:35,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:39:35,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:39:35,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:39:33" (1/3) ... [2019-12-27 21:39:35,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba0b08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:35, skipping insertion in model container [2019-12-27 21:39:35,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:34" (2/3) ... [2019-12-27 21:39:35,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba0b08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:35, skipping insertion in model container [2019-12-27 21:39:35,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:35" (3/3) ... [2019-12-27 21:39:35,271 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt.i [2019-12-27 21:39:35,282 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:39:35,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:39:35,290 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:39:35,292 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:39:35,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,337 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,337 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,337 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,351 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,351 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:35,373 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:39:35,394 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:39:35,395 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:39:35,395 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:39:35,395 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:39:35,395 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:39:35,395 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:39:35,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:39:35,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:39:35,413 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 21:39:35,415 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:35,545 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:35,545 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:35,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:35,570 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:35,655 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:35,656 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:35,661 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:35,674 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:39:35,677 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:39:38,583 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 21:39:38,695 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-27 21:39:38,695 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 21:39:38,698 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 21:39:39,165 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 21:39:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 21:39:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:39:39,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:39,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:39:39,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:39,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-27 21:39:39,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:39,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79607874] [2019-12-27 21:39:39,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:39,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79607874] [2019-12-27 21:39:39,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:39,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:39:39,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445609570] [2019-12-27 21:39:39,390 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:39,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:39,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:39:39,409 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:39,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:39,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:39,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:39,425 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 21:39:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:39,770 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-27 21:39:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:39,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:39:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:39,865 INFO L225 Difference]: With dead ends: 9108 [2019-12-27 21:39:39,866 INFO L226 Difference]: Without dead ends: 8926 [2019-12-27 21:39:39,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-27 21:39:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-27 21:39:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-27 21:39:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-27 21:39:40,446 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-27 21:39:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:40,446 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-27 21:39:40,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-27 21:39:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:40,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:40,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:40,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-27 21:39:40,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:40,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996178588] [2019-12-27 21:39:40,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:40,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996178588] [2019-12-27 21:39:40,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:40,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:40,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534790938] [2019-12-27 21:39:40,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:40,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:40,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:39:40,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:40,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:40,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:40,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:40,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:40,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:40,574 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-27 21:39:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:40,601 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-27 21:39:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:40,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:39:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:40,610 INFO L225 Difference]: With dead ends: 1402 [2019-12-27 21:39:40,610 INFO L226 Difference]: Without dead ends: 1402 [2019-12-27 21:39:40,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-27 21:39:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-27 21:39:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-27 21:39:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-27 21:39:40,649 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-27 21:39:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:40,649 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-27 21:39:40,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-27 21:39:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:40,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:40,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:40,651 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:40,651 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-27 21:39:40,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:40,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963064001] [2019-12-27 21:39:40,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:40,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963064001] [2019-12-27 21:39:40,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:40,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:40,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327426214] [2019-12-27 21:39:40,743 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:40,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:40,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:39:40,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:40,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:40,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:40,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:40,802 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 5 states. [2019-12-27 21:39:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:41,201 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-27 21:39:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:39:41,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:39:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:41,212 INFO L225 Difference]: With dead ends: 1878 [2019-12-27 21:39:41,212 INFO L226 Difference]: Without dead ends: 1878 [2019-12-27 21:39:41,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-27 21:39:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-27 21:39:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 21:39:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-27 21:39:41,263 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-27 21:39:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:41,263 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-27 21:39:41,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-27 21:39:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:39:41,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:41,267 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] [2019-12-27 21:39:41,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:41,267 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-27 21:39:41,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:41,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697770297] [2019-12-27 21:39:41,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:41,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697770297] [2019-12-27 21:39:41,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:41,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:41,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1282951937] [2019-12-27 21:39:41,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:41,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:41,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 21:39:41,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:41,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:41,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:41,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:41,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:41,362 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 5 states. [2019-12-27 21:39:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:41,385 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-27 21:39:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:39:41,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 21:39:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:41,388 INFO L225 Difference]: With dead ends: 357 [2019-12-27 21:39:41,388 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 21:39:41,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 21:39:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 21:39:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 21:39:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-27 21:39:41,397 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-27 21:39:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:41,398 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-27 21:39:41,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-27 21:39:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:41,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:41,401 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-27 21:39:41,401 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-27 21:39:41,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:41,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128553070] [2019-12-27 21:39:41,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:41,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128553070] [2019-12-27 21:39:41,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:41,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:41,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682681631] [2019-12-27 21:39:41,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:41,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:41,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 21:39:41,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:41,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:41,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:41,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:41,631 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-27 21:39:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:41,685 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-27 21:39:41,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:41,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:39:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:41,687 INFO L225 Difference]: With dead ends: 332 [2019-12-27 21:39:41,688 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 21:39:41,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 21:39:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 21:39:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 21:39:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-27 21:39:41,695 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-27 21:39:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:41,697 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-27 21:39:41,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-27 21:39:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:41,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:41,699 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-27 21:39:41,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:41,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-27 21:39:41,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:41,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852521042] [2019-12-27 21:39:41,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:41,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852521042] [2019-12-27 21:39:41,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:41,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:39:41,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989073330] [2019-12-27 21:39:41,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:41,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:41,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 21:39:41,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:41,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:39:41,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:41,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:41,967 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-27 21:39:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:42,187 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-27 21:39:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:39:42,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:39:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:42,193 INFO L225 Difference]: With dead ends: 459 [2019-12-27 21:39:42,193 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 21:39:42,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 21:39:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-27 21:39:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 21:39:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-27 21:39:42,205 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-27 21:39:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:42,208 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-27 21:39:42,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-27 21:39:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:42,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:42,212 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-27 21:39:42,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:42,213 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-27 21:39:42,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:42,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642033293] [2019-12-27 21:39:42,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:42,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642033293] [2019-12-27 21:39:42,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:42,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:42,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302551470] [2019-12-27 21:39:42,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:42,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:42,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 90 transitions. [2019-12-27 21:39:42,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:42,430 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:39:42,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:42,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:42,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:42,431 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 5 states. [2019-12-27 21:39:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:42,578 INFO L93 Difference]: Finished difference Result 451 states and 808 transitions. [2019-12-27 21:39:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:39:42,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:39:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:42,582 INFO L225 Difference]: With dead ends: 451 [2019-12-27 21:39:42,582 INFO L226 Difference]: Without dead ends: 451 [2019-12-27 21:39:42,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:39:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-27 21:39:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 363. [2019-12-27 21:39:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 21:39:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 661 transitions. [2019-12-27 21:39:42,592 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 661 transitions. Word has length 52 [2019-12-27 21:39:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:42,593 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 661 transitions. [2019-12-27 21:39:42,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 661 transitions. [2019-12-27 21:39:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:39:42,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:42,594 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-27 21:39:42,595 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash -817414714, now seen corresponding path program 1 times [2019-12-27 21:39:42,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:42,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476407850] [2019-12-27 21:39:42,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:42,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476407850] [2019-12-27 21:39:42,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:42,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:42,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [973049588] [2019-12-27 21:39:42,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:42,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:42,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 99 transitions. [2019-12-27 21:39:42,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:42,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:42,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:42,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:42,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:42,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:42,893 INFO L87 Difference]: Start difference. First operand 363 states and 661 transitions. Second operand 3 states. [2019-12-27 21:39:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:42,943 INFO L93 Difference]: Finished difference Result 363 states and 660 transitions. [2019-12-27 21:39:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:42,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:39:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:42,945 INFO L225 Difference]: With dead ends: 363 [2019-12-27 21:39:42,945 INFO L226 Difference]: Without dead ends: 363 [2019-12-27 21:39:42,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-27 21:39:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 274. [2019-12-27 21:39:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-27 21:39:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 499 transitions. [2019-12-27 21:39:42,954 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 499 transitions. Word has length 53 [2019-12-27 21:39:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:42,955 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 499 transitions. [2019-12-27 21:39:42,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 499 transitions. [2019-12-27 21:39:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:42,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:42,958 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-27 21:39:42,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1599315070, now seen corresponding path program 1 times [2019-12-27 21:39:42,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:42,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363586656] [2019-12-27 21:39:42,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:43,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363586656] [2019-12-27 21:39:43,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:43,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:39:43,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [214522866] [2019-12-27 21:39:43,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:43,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:43,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 122 transitions. [2019-12-27 21:39:43,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:43,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:39:43,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:39:43,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:39:43,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:39:43,332 INFO L87 Difference]: Start difference. First operand 274 states and 499 transitions. Second operand 13 states. [2019-12-27 21:39:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:44,062 INFO L93 Difference]: Finished difference Result 692 states and 1215 transitions. [2019-12-27 21:39:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:39:44,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 21:39:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:44,065 INFO L225 Difference]: With dead ends: 692 [2019-12-27 21:39:44,065 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 21:39:44,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:39:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 21:39:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-27 21:39:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 21:39:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-27 21:39:44,072 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-27 21:39:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:44,073 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-27 21:39:44,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:39:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-27 21:39:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:44,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:44,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, 1] [2019-12-27 21:39:44,075 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 2 times [2019-12-27 21:39:44,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:44,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257875984] [2019-12-27 21:39:44,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:44,585 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 7 [2019-12-27 21:39:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:44,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257875984] [2019-12-27 21:39:44,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:44,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:39:44,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [730347647] [2019-12-27 21:39:44,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:44,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:44,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 75 transitions. [2019-12-27 21:39:44,737 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:44,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:44,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:39:44,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:39:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:39:44,750 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 14 states. [2019-12-27 21:39:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:45,292 INFO L93 Difference]: Finished difference Result 378 states and 653 transitions. [2019-12-27 21:39:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:39:45,293 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 21:39:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:45,296 INFO L225 Difference]: With dead ends: 378 [2019-12-27 21:39:45,296 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 21:39:45,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:39:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 21:39:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 310. [2019-12-27 21:39:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-27 21:39:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 543 transitions. [2019-12-27 21:39:45,304 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 543 transitions. Word has length 54 [2019-12-27 21:39:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:45,305 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 543 transitions. [2019-12-27 21:39:45,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:39:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 543 transitions. [2019-12-27 21:39:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:45,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:45,306 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-27 21:39:45,307 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:45,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1943073384, now seen corresponding path program 3 times [2019-12-27 21:39:45,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:45,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418357213] [2019-12-27 21:39:45,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:45,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418357213] [2019-12-27 21:39:45,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:45,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:39:45,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764127980] [2019-12-27 21:39:45,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:45,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:45,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 111 transitions. [2019-12-27 21:39:45,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:45,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:39:45,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:39:45,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:45,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:39:45,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:39:45,623 INFO L87 Difference]: Start difference. First operand 310 states and 543 transitions. Second operand 12 states. [2019-12-27 21:39:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:45,888 INFO L93 Difference]: Finished difference Result 414 states and 704 transitions. [2019-12-27 21:39:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:39:45,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 21:39:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:45,892 INFO L225 Difference]: With dead ends: 414 [2019-12-27 21:39:45,892 INFO L226 Difference]: Without dead ends: 380 [2019-12-27 21:39:45,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:39:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-27 21:39:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 318. [2019-12-27 21:39:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-27 21:39:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 557 transitions. [2019-12-27 21:39:45,904 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 557 transitions. Word has length 54 [2019-12-27 21:39:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:45,905 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 557 transitions. [2019-12-27 21:39:45,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:39:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 557 transitions. [2019-12-27 21:39:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:45,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:45,906 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-27 21:39:45,906 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:45,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 4 times [2019-12-27 21:39:45,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:45,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948857047] [2019-12-27 21:39:45,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:46,016 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:39:46,016 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:39:46,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$r_buff1_thd0~0_48 0) (= 0 v_~x$r_buff0_thd0~0_76) (= (store .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22| 1) |v_#valid_47|) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~x$mem_tmp~0_11 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1455~0.base_22| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) (= 0 v_~weak$$choice0~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22|) 0) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_~#t1455~0.base=|v_ULTIMATE.start_main_~#t1455~0.base_22|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, 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|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ULTIMATE.start_main_~#t1455~0.offset=|v_ULTIMATE.start_main_~#t1455~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, 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|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_17|, 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|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y~0=v_~y~0_8, 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_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1455~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1456~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1455~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~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, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:39:46,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1456~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1456~0.base_10|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10|) |v_ULTIMATE.start_main_~#t1456~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1456~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1456~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_10|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_~#t1456~0.offset] because there is no mapped edge [2019-12-27 21:39:46,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_88) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_89) (= 2 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 21:39:46,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-706813921| |P0Thread1of1ForFork0_#t~ite4_Out-706813921|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-706813921 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-706813921 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-706813921| ~x$w_buff1~0_In-706813921)) (and .cse0 (= ~x~0_In-706813921 |P0Thread1of1ForFork0_#t~ite3_Out-706813921|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-706813921, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706813921, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-706813921, ~x~0=~x~0_In-706813921} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-706813921|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-706813921|, ~x$w_buff1~0=~x$w_buff1~0_In-706813921, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706813921, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-706813921, ~x~0=~x~0_In-706813921} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:39:46,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1629373109 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1629373109 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1629373109|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1629373109 |P0Thread1of1ForFork0_#t~ite5_Out1629373109|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1629373109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1629373109|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1629373109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:39:46,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1437456277 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1437456277 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1437456277 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1437456277 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1437456277|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1437456277 |P0Thread1of1ForFork0_#t~ite6_Out1437456277|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1437456277, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1437456277, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1437456277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437456277} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1437456277|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1437456277, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1437456277, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1437456277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437456277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:39:46,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2127492266 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2127492266 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-2127492266|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-2127492266| ~x$w_buff0_used~0_In-2127492266)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2127492266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2127492266} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2127492266|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2127492266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2127492266} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:39:46,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1784525651 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1784525651 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1784525651| ~x$r_buff0_thd1~0_In-1784525651) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-1784525651| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1784525651, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1784525651|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:39:46,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1403867093 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1403867093 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1403867093 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1403867093 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1403867093| ~x$r_buff1_thd1~0_In1403867093) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1403867093|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1403867093, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1403867093, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1403867093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1403867093} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1403867093, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1403867093|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1403867093, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1403867093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1403867093} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:39:46,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{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, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:39:46,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1014658524 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1014658524 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1014658524 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1014658524 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out-1014658524| ~x$w_buff1_used~0_In-1014658524)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1014658524| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1014658524, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1014658524, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1014658524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014658524} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1014658524, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1014658524, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1014658524|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1014658524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014658524} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:39:46,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In402649809 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In402649809 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In402649809 ~x$r_buff0_thd2~0_Out402649809)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out402649809)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In402649809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out402649809|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out402649809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:39:46,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1832296787 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1832296787 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1832296787 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1832296787 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1832296787|)) (and (= ~x$r_buff1_thd2~0_In1832296787 |P1Thread1of1ForFork1_#t~ite14_Out1832296787|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1832296787, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1832296787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1832296787, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1832296787, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1832296787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:39:46,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |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{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__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[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:39:46,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:39:46,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out937724730| |ULTIMATE.start_main_#t~ite17_Out937724730|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In937724730 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In937724730 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In937724730 |ULTIMATE.start_main_#t~ite17_Out937724730|)) (and .cse0 (= ~x$w_buff1~0_In937724730 |ULTIMATE.start_main_#t~ite17_Out937724730|) (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In937724730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In937724730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In937724730, ~x~0=~x~0_In937724730} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out937724730|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out937724730|, ~x$w_buff1~0=~x$w_buff1~0_In937724730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In937724730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In937724730, ~x~0=~x~0_In937724730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 21:39:46,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-517751118 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-517751118 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-517751118|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-517751118 |ULTIMATE.start_main_#t~ite19_Out-517751118|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-517751118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-517751118, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-517751118|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:39:46,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2028361257 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2028361257 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2028361257 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2028361257 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-2028361257| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite20_Out-2028361257| ~x$w_buff1_used~0_In-2028361257)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2028361257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028361257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2028361257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028361257} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2028361257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028361257, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2028361257|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2028361257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028361257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:39:46,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1240110796 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1240110796 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1240110796| ~x$r_buff0_thd0~0_In1240110796)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1240110796| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1240110796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240110796} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1240110796, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1240110796|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240110796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:39:46,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-229395722 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-229395722 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-229395722 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-229395722 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-229395722| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-229395722 |ULTIMATE.start_main_#t~ite22_Out-229395722|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-229395722, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229395722, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-229395722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-229395722, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229395722, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-229395722, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-229395722|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:39:46,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1523733808 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out1523733808| ~x$w_buff1~0_In1523733808) (= |ULTIMATE.start_main_#t~ite31_In1523733808| |ULTIMATE.start_main_#t~ite31_Out1523733808|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite32_Out1523733808| |ULTIMATE.start_main_#t~ite31_Out1523733808|) (= ~x$w_buff1~0_In1523733808 |ULTIMATE.start_main_#t~ite31_Out1523733808|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1523733808 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In1523733808 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1523733808 256))) (= 0 (mod ~x$w_buff0_used~0_In1523733808 256)))) .cse0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1523733808, ~x$w_buff1~0=~x$w_buff1~0_In1523733808, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1523733808, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1523733808, ~weak$$choice2~0=~weak$$choice2~0_In1523733808, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1523733808|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523733808} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1523733808, ~x$w_buff1~0=~x$w_buff1~0_In1523733808, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1523733808, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1523733808|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1523733808, ~weak$$choice2~0=~weak$$choice2~0_In1523733808, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1523733808|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523733808} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 21:39:46,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd0~0_65 v_~x$r_buff0_thd0~0_64)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:39:46,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L806-->L809-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$mem_tmp~0_7 v_~x~0_22) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:39:46,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:39:46,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:39:46 BasicIcfg [2019-12-27 21:39:46,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:39:46,122 INFO L168 Benchmark]: Toolchain (without parser) took 12499.13 ms. Allocated memory was 137.9 MB in the beginning and 544.2 MB in the end (delta: 406.3 MB). Free memory was 101.3 MB in the beginning and 436.2 MB in the end (delta: -335.0 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:46,123 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:39:46,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.78 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:46,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:46,130 INFO L168 Benchmark]: Boogie Preprocessor took 48.81 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:46,132 INFO L168 Benchmark]: RCFGBuilder took 800.88 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 107.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:46,133 INFO L168 Benchmark]: TraceAbstraction took 10856.70 ms. Allocated memory was 202.4 MB in the beginning and 544.2 MB in the end (delta: 341.8 MB). Free memory was 107.5 MB in the beginning and 436.2 MB in the end (delta: -328.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:46,141 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.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.78 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 202.4 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.81 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.88 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 107.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10856.70 ms. Allocated memory was 202.4 MB in the beginning and 544.2 MB in the end (delta: 341.8 MB). Free memory was 107.5 MB in the beginning and 436.2 MB in the end (delta: -328.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 146 ProgramPointsBefore, 80 ProgramPointsAfterwards, 180 TransitionsBefore, 93 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 3674 VarBasedMoverChecksPositive, 148 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48801 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1088 SDtfs, 1471 SDslu, 3045 SDs, 0 SdLazy, 1692 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 28 SyntacticMatches, 17 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 572 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 76333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...