/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.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:39:28,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:39:28,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:39:28,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:39:28,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:39:28,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:39:28,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:39:28,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:39:28,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:39:28,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:39:28,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:39:28,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:39:28,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:39:28,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:39:28,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:39:28,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:39:28,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:39:28,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:39:28,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:39:28,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:39:28,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:39:28,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:39:28,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:39:28,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:39:28,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:39:28,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:39:28,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:39:28,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:39:28,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:39:28,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:39:28,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:39:28,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:39:28,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:39:28,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:39:28,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:39:28,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:39:28,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:39:28,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:39:28,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:39:28,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:39:28,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:39:28,249 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:28,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:39:28,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:39:28,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:39:28,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:39:28,272 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:39:28,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:39:28,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:39:28,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:39:28,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:39:28,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:39:28,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:39:28,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:39:28,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:39:28,275 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:39:28,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:39:28,275 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:39:28,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:39:28,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:39:28,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:39:28,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:39:28,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:39:28,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:39:28,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:39:28,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:39:28,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:39:28,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:39:28,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:39:28,280 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:39:28,280 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:39:28,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:39:28,281 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:39:28,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:39:28,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:39:28,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:39:28,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:39:28,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:39:28,605 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:39:28,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-27 21:39:28,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9800580/b5aea5fbad094a1fabbfcea862d00972/FLAG0f7bb1b0f [2019-12-27 21:39:29,254 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:39:29,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-27 21:39:29,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9800580/b5aea5fbad094a1fabbfcea862d00972/FLAG0f7bb1b0f [2019-12-27 21:39:29,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9800580/b5aea5fbad094a1fabbfcea862d00972 [2019-12-27 21:39:29,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:39:29,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:39:29,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:29,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:39:29,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:39:29,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:29" (1/1) ... [2019-12-27 21:39:29,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fcd619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:29, skipping insertion in model container [2019-12-27 21:39:29,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:29" (1/1) ... [2019-12-27 21:39:29,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:39:29,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:39:30,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:30,141 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:39:30,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:30,300 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:39:30,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:30 WrapperNode [2019-12-27 21:39:30,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:30,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:30,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:39:30,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:39:30,312 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:30" (1/1) ... [2019-12-27 21:39:30,331 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:30" (1/1) ... [2019-12-27 21:39:30,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:30,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:39:30,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:39:30,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:39:30,383 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:30" (1/1) ... [2019-12-27 21:39:30,383 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:30" (1/1) ... [2019-12-27 21:39:30,387 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:30" (1/1) ... [2019-12-27 21:39:30,388 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:30" (1/1) ... [2019-12-27 21:39:30,397 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:30" (1/1) ... [2019-12-27 21:39:30,401 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:30" (1/1) ... [2019-12-27 21:39:30,405 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:30" (1/1) ... [2019-12-27 21:39:30,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:39:30,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:39:30,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:39:30,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:39:30,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:30" (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:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:39:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:39:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:39:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:39:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:39:30,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:39:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:39:30,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:39:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:39:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:39:30,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:39:30,477 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:31,207 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:39:31,207 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:39:31,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:31 BoogieIcfgContainer [2019-12-27 21:39:31,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:39:31,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:39:31,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:39:31,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:39:31,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:39:29" (1/3) ... [2019-12-27 21:39:31,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1f7d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:31, skipping insertion in model container [2019-12-27 21:39:31,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:30" (2/3) ... [2019-12-27 21:39:31,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1f7d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:31, skipping insertion in model container [2019-12-27 21:39:31,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:31" (3/3) ... [2019-12-27 21:39:31,218 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2019-12-27 21:39:31,229 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:39:31,229 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:39:31,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:39:31,242 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:39:31,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,300 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:31,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,313 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,317 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:31,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:31,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:39:31,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:39:31,353 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:39:31,353 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:39:31,353 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:39:31,353 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:39:31,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:39:31,354 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:39:31,354 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:39:31,371 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 21:39:31,373 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:31,477 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:31,478 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:31,493 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:31,515 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:31,586 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:31,586 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:31,594 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:31,609 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:39:31,610 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:39:34,589 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 21:39:34,711 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 21:39:34,731 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-27 21:39:34,731 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 21:39:34,734 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 21:39:35,201 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 21:39:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 21:39:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:39:35,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:35,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:39:35,209 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:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-27 21:39:35,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:35,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133284571] [2019-12-27 21:39:35,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:35,438 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:35,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133284571] [2019-12-27 21:39:35,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:35,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:39:35,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093444040] [2019-12-27 21:39:35,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:35,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:35,457 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:39:35,458 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:35,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:35,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:35,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:35,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:35,476 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 21:39:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:35,720 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-27 21:39:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:35,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:39:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:35,819 INFO L225 Difference]: With dead ends: 9108 [2019-12-27 21:39:35,819 INFO L226 Difference]: Without dead ends: 8926 [2019-12-27 21:39:35,821 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:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-27 21:39:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-27 21:39:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-27 21:39:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-27 21:39:36,361 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-27 21:39:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:36,362 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-27 21:39:36,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-27 21:39:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:36,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:36,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:36,368 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:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-27 21:39:36,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:36,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526065101] [2019-12-27 21:39:36,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:36,474 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:36,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526065101] [2019-12-27 21:39:36,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:36,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:36,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586729328] [2019-12-27 21:39:36,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:36,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:36,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:39:36,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:36,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:36,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:36,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:36,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:36,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:36,482 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-27 21:39:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:36,510 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-27 21:39:36,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:36,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:39:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:36,518 INFO L225 Difference]: With dead ends: 1402 [2019-12-27 21:39:36,518 INFO L226 Difference]: Without dead ends: 1402 [2019-12-27 21:39:36,519 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:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-27 21:39:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-27 21:39:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-27 21:39:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-27 21:39:36,553 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-27 21:39:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:36,554 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-27 21:39:36,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-27 21:39:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:36,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:36,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:36,555 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:36,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-27 21:39:36,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:36,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374789301] [2019-12-27 21:39:36,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:36,623 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:36,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374789301] [2019-12-27 21:39:36,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:36,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:36,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1564006434] [2019-12-27 21:39:36,625 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:36,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:36,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:39:36,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:36,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:36,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:36,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:36,675 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 5 states. [2019-12-27 21:39:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:37,011 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-27 21:39:37,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:39:37,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:39:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:37,022 INFO L225 Difference]: With dead ends: 1878 [2019-12-27 21:39:37,023 INFO L226 Difference]: Without dead ends: 1878 [2019-12-27 21:39:37,023 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:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-27 21:39:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-27 21:39:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 21:39:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-27 21:39:37,123 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-27 21:39:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:37,124 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-27 21:39:37,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-27 21:39:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:39:37,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:37,131 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:37,132 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:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-27 21:39:37,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:37,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117263357] [2019-12-27 21:39:37,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:37,248 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:37,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117263357] [2019-12-27 21:39:37,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:37,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:37,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371267033] [2019-12-27 21:39:37,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:37,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:37,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 21:39:37,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:37,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:37,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:37,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:37,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:37,287 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 5 states. [2019-12-27 21:39:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:37,306 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-27 21:39:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:39:37,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 21:39:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:37,309 INFO L225 Difference]: With dead ends: 357 [2019-12-27 21:39:37,309 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 21:39:37,310 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:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 21:39:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 21:39:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 21:39:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-27 21:39:37,317 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-27 21:39:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:37,318 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-27 21:39:37,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-27 21:39:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:37,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:37,320 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:37,320 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:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-27 21:39:37,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:37,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126148220] [2019-12-27 21:39:37,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:37,438 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:37,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126148220] [2019-12-27 21:39:37,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:37,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:37,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696336995] [2019-12-27 21:39:37,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:37,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:37,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 21:39:37,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:37,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:37,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:37,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:37,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:37,508 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-27 21:39:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:37,560 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-27 21:39:37,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:37,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:39:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:37,563 INFO L225 Difference]: With dead ends: 332 [2019-12-27 21:39:37,563 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 21:39:37,564 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:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 21:39:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 21:39:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 21:39:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-27 21:39:37,571 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-27 21:39:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:37,574 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-27 21:39:37,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-27 21:39:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:37,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:37,578 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:37,578 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:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-27 21:39:37,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:37,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054644562] [2019-12-27 21:39:37,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:37,736 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:37,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054644562] [2019-12-27 21:39:37,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:37,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:39:37,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805968025] [2019-12-27 21:39:37,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:37,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:37,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 21:39:37,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:37,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:39:37,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:37,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:37,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:37,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:37,800 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-27 21:39:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:38,040 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-27 21:39:38,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:39:38,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:39:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:38,043 INFO L225 Difference]: With dead ends: 459 [2019-12-27 21:39:38,043 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 21:39:38,044 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:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 21:39:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-27 21:39:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 21:39:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-27 21:39:38,059 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-27 21:39:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:38,063 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-27 21:39:38,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-27 21:39:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:38,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:38,064 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:38,065 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:38,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:38,065 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-27 21:39:38,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:38,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892937162] [2019-12-27 21:39:38,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:38,264 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:38,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892937162] [2019-12-27 21:39:38,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:38,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:39:38,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551927487] [2019-12-27 21:39:38,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:38,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:38,315 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 90 transitions. [2019-12-27 21:39:38,315 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:38,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:38,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:39:38,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:38,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:39:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:38,317 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 6 states. [2019-12-27 21:39:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:38,663 INFO L93 Difference]: Finished difference Result 514 states and 945 transitions. [2019-12-27 21:39:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:39:38,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 21:39:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:38,665 INFO L225 Difference]: With dead ends: 514 [2019-12-27 21:39:38,665 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 21:39:38,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:39:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 21:39:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 407. [2019-12-27 21:39:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 21:39:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 757 transitions. [2019-12-27 21:39:38,675 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 757 transitions. Word has length 52 [2019-12-27 21:39:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:38,675 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 757 transitions. [2019-12-27 21:39:38,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:39:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 757 transitions. [2019-12-27 21:39:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:38,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:38,677 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:38,677 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:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -105866605, now seen corresponding path program 3 times [2019-12-27 21:39:38,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:38,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855620494] [2019-12-27 21:39:38,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:38,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855620494] [2019-12-27 21:39:38,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:38,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:39:38,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166826125] [2019-12-27 21:39:38,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:38,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:38,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 103 transitions. [2019-12-27 21:39:38,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:38,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:39:38,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:39:38,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:39:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:39:38,928 INFO L87 Difference]: Start difference. First operand 407 states and 757 transitions. Second operand 10 states. [2019-12-27 21:39:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:39,981 INFO L93 Difference]: Finished difference Result 1013 states and 1770 transitions. [2019-12-27 21:39:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:39:39,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 21:39:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:39,993 INFO L225 Difference]: With dead ends: 1013 [2019-12-27 21:39:39,993 INFO L226 Difference]: Without dead ends: 1013 [2019-12-27 21:39:39,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:39:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-12-27 21:39:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 446. [2019-12-27 21:39:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-27 21:39:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 836 transitions. [2019-12-27 21:39:40,007 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 836 transitions. Word has length 52 [2019-12-27 21:39:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:40,008 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 836 transitions. [2019-12-27 21:39:40,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:39:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 836 transitions. [2019-12-27 21:39:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:40,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:40,009 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:40,009 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:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash 499685509, now seen corresponding path program 4 times [2019-12-27 21:39:40,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:40,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214594053] [2019-12-27 21:39:40,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:40,073 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,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214594053] [2019-12-27 21:39:40,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:40,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:40,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782832413] [2019-12-27 21:39:40,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:40,088 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:40,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 102 transitions. [2019-12-27 21:39:40,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:40,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:39:40,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:40,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:40,126 INFO L87 Difference]: Start difference. First operand 446 states and 836 transitions. Second operand 5 states. [2019-12-27 21:39:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:40,278 INFO L93 Difference]: Finished difference Result 511 states and 919 transitions. [2019-12-27 21:39:40,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:39:40,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:39:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:40,282 INFO L225 Difference]: With dead ends: 511 [2019-12-27 21:39:40,283 INFO L226 Difference]: Without dead ends: 511 [2019-12-27 21:39:40,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:40,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-27 21:39:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 407. [2019-12-27 21:39:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 21:39:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 742 transitions. [2019-12-27 21:39:40,292 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 742 transitions. Word has length 52 [2019-12-27 21:39:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:40,292 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 742 transitions. [2019-12-27 21:39:40,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 742 transitions. [2019-12-27 21:39:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:39:40,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:40,294 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:40,294 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:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1369378336, now seen corresponding path program 1 times [2019-12-27 21:39:40,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:40,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899660131] [2019-12-27 21:39:40,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:40,448 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,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899660131] [2019-12-27 21:39:40,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:40,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:39:40,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [707235451] [2019-12-27 21:39:40,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:40,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:40,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 109 transitions. [2019-12-27 21:39:40,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:40,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:39:40,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:39:40,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:39:40,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:39:40,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:39:40,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:39:40,572 INFO L87 Difference]: Start difference. First operand 407 states and 742 transitions. Second operand 9 states. [2019-12-27 21:39:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:41,331 INFO L93 Difference]: Finished difference Result 672 states and 1195 transitions. [2019-12-27 21:39:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:39:41,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 21:39:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:41,336 INFO L225 Difference]: With dead ends: 672 [2019-12-27 21:39:41,337 INFO L226 Difference]: Without dead ends: 672 [2019-12-27 21:39:41,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:39:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-27 21:39:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 363. [2019-12-27 21:39:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 21:39:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 657 transitions. [2019-12-27 21:39:41,346 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 657 transitions. Word has length 53 [2019-12-27 21:39:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:41,347 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 657 transitions. [2019-12-27 21:39:41,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:39:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 657 transitions. [2019-12-27 21:39:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:39:41,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:41,348 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:41,348 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:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash 693182888, now seen corresponding path program 2 times [2019-12-27 21:39:41,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:41,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481304577] [2019-12-27 21:39:41,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:41,465 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,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481304577] [2019-12-27 21:39:41,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:41,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:39:41,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131575106] [2019-12-27 21:39:41,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:41,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:41,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 108 transitions. [2019-12-27 21:39:41,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:41,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:39:41,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:39:41,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:41,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:39:41,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:39:41,545 INFO L87 Difference]: Start difference. First operand 363 states and 657 transitions. Second operand 8 states. [2019-12-27 21:39:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:41,642 INFO L93 Difference]: Finished difference Result 617 states and 1103 transitions. [2019-12-27 21:39:41,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:39:41,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 21:39:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:41,644 INFO L225 Difference]: With dead ends: 617 [2019-12-27 21:39:41,644 INFO L226 Difference]: Without dead ends: 271 [2019-12-27 21:39:41,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:39:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-27 21:39:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 247. [2019-12-27 21:39:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-27 21:39:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 427 transitions. [2019-12-27 21:39:41,650 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 427 transitions. Word has length 53 [2019-12-27 21:39:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:41,650 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 427 transitions. [2019-12-27 21:39:41,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:39:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 427 transitions. [2019-12-27 21:39:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:39:41,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:41,651 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:41,652 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:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2092379572, now seen corresponding path program 3 times [2019-12-27 21:39:41,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:41,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262777431] [2019-12-27 21:39:41,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:41,707 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,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262777431] [2019-12-27 21:39:41,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:41,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:41,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858126947] [2019-12-27 21:39:41,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:41,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:41,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 102 transitions. [2019-12-27 21:39:41,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:41,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:41,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:41,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:41,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:41,759 INFO L87 Difference]: Start difference. First operand 247 states and 427 transitions. Second operand 3 states. [2019-12-27 21:39:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:41,801 INFO L93 Difference]: Finished difference Result 247 states and 426 transitions. [2019-12-27 21:39:41,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:41,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:39:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:41,803 INFO L225 Difference]: With dead ends: 247 [2019-12-27 21:39:41,803 INFO L226 Difference]: Without dead ends: 247 [2019-12-27 21:39:41,803 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:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-27 21:39:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 198. [2019-12-27 21:39:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-27 21:39:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 342 transitions. [2019-12-27 21:39:41,813 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 342 transitions. Word has length 53 [2019-12-27 21:39:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:41,813 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 342 transitions. [2019-12-27 21:39:41,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 342 transitions. [2019-12-27 21:39:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:41,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:41,814 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:41,814 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 1 times [2019-12-27 21:39:41,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:41,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954518595] [2019-12-27 21:39:41,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:42,107 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,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954518595] [2019-12-27 21:39:42,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:42,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:39:42,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72929069] [2019-12-27 21:39:42,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:42,138 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:42,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 75 transitions. [2019-12-27 21:39:42,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:42,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:42,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:39:42,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:39:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:39:42,287 INFO L87 Difference]: Start difference. First operand 198 states and 342 transitions. Second operand 14 states. [2019-12-27 21:39:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:42,869 INFO L93 Difference]: Finished difference Result 366 states and 623 transitions. [2019-12-27 21:39:42,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:39:42,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 21:39:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:42,872 INFO L225 Difference]: With dead ends: 366 [2019-12-27 21:39:42,872 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 21:39:42,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:39:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 21:39:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 298. [2019-12-27 21:39:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-27 21:39:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 513 transitions. [2019-12-27 21:39:42,880 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 513 transitions. Word has length 54 [2019-12-27 21:39:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:42,880 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 513 transitions. [2019-12-27 21:39:42,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:39:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 513 transitions. [2019-12-27 21:39:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:42,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:42,881 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,881 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1943073384, now seen corresponding path program 2 times [2019-12-27 21:39:42,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:42,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583324984] [2019-12-27 21:39:42,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:43,104 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,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583324984] [2019-12-27 21:39:43,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:43,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:39:43,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [174853382] [2019-12-27 21:39:43,105 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:43,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:43,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 111 transitions. [2019-12-27 21:39:43,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:43,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:39:43,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:39:43,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:39:43,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:39:43,196 INFO L87 Difference]: Start difference. First operand 298 states and 513 transitions. Second operand 12 states. [2019-12-27 21:39:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:43,452 INFO L93 Difference]: Finished difference Result 402 states and 674 transitions. [2019-12-27 21:39:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:39:43,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 21:39:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:43,454 INFO L225 Difference]: With dead ends: 402 [2019-12-27 21:39:43,454 INFO L226 Difference]: Without dead ends: 368 [2019-12-27 21:39:43,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:39:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-27 21:39:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 306. [2019-12-27 21:39:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-27 21:39:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 527 transitions. [2019-12-27 21:39:43,462 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 527 transitions. Word has length 54 [2019-12-27 21:39:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:43,462 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 527 transitions. [2019-12-27 21:39:43,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:39:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 527 transitions. [2019-12-27 21:39:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:43,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:43,463 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:43,464 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:43,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 3 times [2019-12-27 21:39:43,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:43,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383092225] [2019-12-27 21:39:43,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:43,588 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:39:43,588 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:39:43,592 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) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22|)) (= v_~x$flush_delayed~0_16 0) (= |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1453~0.base_22| 4) |v_#length_15|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= v_~x$r_buff1_thd0~0_48 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22| 1)) (= 0 v_~x$r_buff0_thd0~0_76) (= 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_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) (= 0 v_~weak$$choice0~0_6) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0)) |v_#memory_int_13|))) 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, #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|, ULTIMATE.start_main_~#t1453~0.offset=|v_ULTIMATE.start_main_~#t1453~0.offset_17|, ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_17|, ~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|, ~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, ~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_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_14|, 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_#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|, ULTIMATE.start_main_~#t1453~0.base=|v_ULTIMATE.start_main_~#t1453~0.base_22|, ~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, #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, ULTIMATE.start_main_~#t1453~0.offset, ULTIMATE.start_main_~#t1454~0.base, ~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, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1453~0.base, ~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:43,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1454~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1454~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10|) |v_ULTIMATE.start_main_~#t1454~0.offset_9| 1))) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1454~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10|) 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1454~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1454~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:39:43,593 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:43,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-2115447728| |P0Thread1of1ForFork0_#t~ite3_Out-2115447728|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2115447728 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-2115447728 256) 0))) (or (and (= ~x$w_buff1~0_In-2115447728 |P0Thread1of1ForFork0_#t~ite3_Out-2115447728|) (not .cse0) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-2115447728| ~x~0_In-2115447728) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2115447728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115447728, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115447728, ~x~0=~x~0_In-2115447728} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-2115447728|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-2115447728|, ~x$w_buff1~0=~x$w_buff1~0_In-2115447728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115447728, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115447728, ~x~0=~x~0_In-2115447728} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:39:43,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-229395722 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-229395722 256) 0))) (or (and (= ~x$w_buff0_used~0_In-229395722 |P0Thread1of1ForFork0_#t~ite5_Out-229395722|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-229395722|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-229395722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-229395722|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-229395722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:39:43,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In230775093 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In230775093 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In230775093 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In230775093 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out230775093| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out230775093| ~x$w_buff1_used~0_In230775093)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In230775093, ~x$w_buff1_used~0=~x$w_buff1_used~0_In230775093, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In230775093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230775093} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out230775093|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In230775093, ~x$w_buff1_used~0=~x$w_buff1_used~0_In230775093, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In230775093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230775093} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:39:43,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1403867093 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1403867093 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1403867093 |P1Thread1of1ForFork1_#t~ite11_Out1403867093|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1403867093|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1403867093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1403867093} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1403867093|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1403867093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1403867093} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:39:43,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2127492266 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-2127492266 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-2127492266|)) (and (= ~x$r_buff0_thd1~0_In-2127492266 |P0Thread1of1ForFork0_#t~ite7_Out-2127492266|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2127492266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2127492266} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2127492266, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2127492266|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2127492266} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:39:43,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In466014473 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In466014473 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In466014473 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In466014473 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out466014473| 0)) (and (= ~x$r_buff1_thd1~0_In466014473 |P0Thread1of1ForFork0_#t~ite8_Out466014473|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In466014473, ~x$w_buff1_used~0=~x$w_buff1_used~0_In466014473, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In466014473, ~x$w_buff0_used~0=~x$w_buff0_used~0_In466014473} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In466014473, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out466014473|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In466014473, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In466014473, ~x$w_buff0_used~0=~x$w_buff0_used~0_In466014473} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:39:43,600 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:43,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-706813921 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-706813921 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-706813921 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-706813921 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-706813921 |P1Thread1of1ForFork1_#t~ite12_Out-706813921|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-706813921|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-706813921, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-706813921, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-706813921, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706813921} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-706813921, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-706813921, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-706813921|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-706813921, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706813921} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:39:43,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In937724730 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In937724730 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out937724730) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In937724730 ~x$r_buff0_thd2~0_Out937724730)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In937724730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In937724730} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out937724730|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out937724730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In937724730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:39:43,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1784525651 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1784525651 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1784525651 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1784525651 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1784525651 |P1Thread1of1ForFork1_#t~ite14_Out-1784525651|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1784525651|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1784525651, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1784525651, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1784525651, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1784525651|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:39:43,601 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:43,601 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:43,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-297776403 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-297776403 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out-297776403| |ULTIMATE.start_main_#t~ite18_Out-297776403|))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-297776403| ~x~0_In-297776403) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-297776403| ~x$w_buff1~0_In-297776403) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-297776403, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-297776403, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-297776403, ~x~0=~x~0_In-297776403} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-297776403|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-297776403|, ~x$w_buff1~0=~x$w_buff1~0_In-297776403, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-297776403, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-297776403, ~x~0=~x~0_In-297776403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 21:39:43,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2028361257 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-2028361257 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out-2028361257|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-2028361257 |ULTIMATE.start_main_#t~ite19_Out-2028361257|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_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, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2028361257|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028361257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:39:43,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1151098661 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1151098661 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1151098661 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1151098661 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1151098661| ~x$w_buff1_used~0_In1151098661) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out1151098661| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1151098661, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151098661, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1151098661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151098661} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1151098661, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151098661, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1151098661|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1151098661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151098661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:39:43,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In402649809 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In402649809 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out402649809| ~x$r_buff0_thd0~0_In402649809)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out402649809|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In402649809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In402649809, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out402649809|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:39:43,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-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))) (.cse3 (= (mod ~x$w_buff1_used~0_In-517751118 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-517751118 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-517751118| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out-517751118| ~x$r_buff1_thd0~0_In-517751118)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-517751118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-517751118, ~x$r_buff1_thd0~0=~x$r_buff1_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, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-517751118, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-517751118, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-517751118|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:39:43,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1832296787 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In1832296787| |ULTIMATE.start_main_#t~ite31_Out1832296787|) (= |ULTIMATE.start_main_#t~ite32_Out1832296787| ~x$w_buff1~0_In1832296787)) (and (= ~x$w_buff1~0_In1832296787 |ULTIMATE.start_main_#t~ite31_Out1832296787|) (= |ULTIMATE.start_main_#t~ite32_Out1832296787| |ULTIMATE.start_main_#t~ite31_Out1832296787|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1832296787 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In1832296787 256)) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In1832296787 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1832296787 256))))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1832296787, ~x$w_buff1~0=~x$w_buff1~0_In1832296787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1832296787, ~weak$$choice2~0=~weak$$choice2~0_In1832296787, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1832296787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1832296787, ~x$w_buff1~0=~x$w_buff1~0_In1832296787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1832296787|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1832296787, ~weak$$choice2~0=~weak$$choice2~0_In1832296787, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1832296787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 21:39:43,609 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:43,610 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:43,610 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:43,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:39:43 BasicIcfg [2019-12-27 21:39:43,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:39:43,711 INFO L168 Benchmark]: Toolchain (without parser) took 14258.76 ms. Allocated memory was 143.7 MB in the beginning and 501.2 MB in the end (delta: 357.6 MB). Free memory was 100.1 MB in the beginning and 133.9 MB in the end (delta: -33.9 MB). Peak memory consumption was 323.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:43,712 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 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:43,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 847.44 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 153.3 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:43,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.08 ms. Allocated memory is still 200.8 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:43,715 INFO L168 Benchmark]: Boogie Preprocessor took 37.75 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:43,716 INFO L168 Benchmark]: RCFGBuilder took 798.51 ms. Allocated memory is still 200.8 MB. Free memory was 148.2 MB in the beginning and 103.7 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:43,716 INFO L168 Benchmark]: TraceAbstraction took 12499.27 ms. Allocated memory was 200.8 MB in the beginning and 501.2 MB in the end (delta: 300.4 MB). Free memory was 103.0 MB in the beginning and 133.9 MB in the end (delta: -31.0 MB). Peak memory consumption was 269.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:43,721 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.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 847.44 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 153.3 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.08 ms. Allocated memory is still 200.8 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.75 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.51 ms. Allocated memory is still 200.8 MB. Free memory was 148.2 MB in the beginning and 103.7 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12499.27 ms. Allocated memory was 200.8 MB in the beginning and 501.2 MB in the end (delta: 300.4 MB). Free memory was 103.0 MB in the beginning and 133.9 MB in the end (delta: -31.0 MB). Peak memory consumption was 269.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 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(&t1453, ((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(&t1454, ((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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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: 12.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1425 SDtfs, 1797 SDslu, 3593 SDs, 0 SdLazy, 2241 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 48 SyntacticMatches, 25 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.9s 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, 14 MinimizatonAttempts, 1531 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 563 ConstructedInterpolants, 0 QuantifiedInterpolants, 96202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...