/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:11:32,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:11:32,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:11:32,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:11:32,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:11:32,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:11:32,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:11:32,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:11:32,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:11:32,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:11:32,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:11:32,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:11:32,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:11:32,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:11:32,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:11:32,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:11:32,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:11:32,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:11:32,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:11:32,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:11:32,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:11:32,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:11:32,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:11:32,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:11:32,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:11:32,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:11:32,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:11:32,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:11:32,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:11:32,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:11:32,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:11:32,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:11:32,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:11:32,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:11:32,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:11:32,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:11:32,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:11:32,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:11:32,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:11:32,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:11:32,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:11:32,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 01:11:32,327 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:11:32,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:11:32,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:11:32,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:11:32,330 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:11:32,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:11:32,331 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:11:32,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:11:32,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:11:32,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:11:32,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:11:32,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:11:32,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:11:32,333 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:11:32,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:11:32,334 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:11:32,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:11:32,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:11:32,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:11:32,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:11:32,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:11:32,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:11:32,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:11:32,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:11:32,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:11:32,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:11:32,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:11:32,336 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:11:32,337 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:11:32,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:11:32,337 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:11:32,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:11:32,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:11:32,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:11:32,667 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:11:32,667 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:11:32,668 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-06 01:11:32,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9183f4824/c2c2965c2fdb4167b337af7970f16b74/FLAG8918ebf17 [2020-10-06 01:11:33,358 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:11:33,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-06 01:11:33,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9183f4824/c2c2965c2fdb4167b337af7970f16b74/FLAG8918ebf17 [2020-10-06 01:11:33,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9183f4824/c2c2965c2fdb4167b337af7970f16b74 [2020-10-06 01:11:33,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:11:33,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:11:33,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:11:33,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:11:33,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:11:33,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:11:33" (1/1) ... [2020-10-06 01:11:33,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7caae38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:33, skipping insertion in model container [2020-10-06 01:11:33,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:11:33" (1/1) ... [2020-10-06 01:11:33,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:11:33,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:11:34,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:11:34,151 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:11:34,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:11:34,297 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:11:34,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34 WrapperNode [2020-10-06 01:11:34,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:11:34,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:11:34,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:11:34,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:11:34,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:11:34,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:11:34,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:11:34,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:11:34,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... [2020-10-06 01:11:34,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:11:34,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:11:34,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:11:34,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:11:34,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:11:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:11:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 01:11:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:11:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:11:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 01:11:34,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 01:11:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 01:11:34,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 01:11:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 01:11:34,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 01:11:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 01:11:34,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:11:34,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:11:34,520 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:11:36,435 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:11:36,436 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 01:11:36,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:11:36 BoogieIcfgContainer [2020-10-06 01:11:36,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:11:36,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:11:36,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:11:36,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:11:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:11:33" (1/3) ... [2020-10-06 01:11:36,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1231a767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:11:36, skipping insertion in model container [2020-10-06 01:11:36,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:34" (2/3) ... [2020-10-06 01:11:36,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1231a767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:11:36, skipping insertion in model container [2020-10-06 01:11:36,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:11:36" (3/3) ... [2020-10-06 01:11:36,447 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-10-06 01:11:36,458 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:11:36,458 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:11:36,467 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 01:11:36,468 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:11:36,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,517 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:36,539 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 01:11:36,560 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:11:36,561 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:11:36,561 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:11:36,561 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:11:36,561 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:11:36,561 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:11:36,562 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:11:36,562 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:11:36,578 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-06 01:11:36,580 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-06 01:11:36,626 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-06 01:11:36,626 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:11:36,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 01:11:36,635 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-06 01:11:36,658 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-06 01:11:36,658 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:11:36,659 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 01:11:36,661 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1536 [2020-10-06 01:11:36,663 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:11:38,391 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-06 01:11:38,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 01:11:38,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:11:38,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-06 01:11:38,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:11:39,564 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-06 01:11:40,185 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-06 01:11:40,290 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 01:11:41,109 WARN L193 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-06 01:11:41,386 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-06 01:11:42,517 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-06 01:11:42,846 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-06 01:11:43,417 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-06 01:11:43,843 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-06 01:11:44,207 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-06 01:11:44,311 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3907 [2020-10-06 01:11:44,311 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-10-06 01:11:44,314 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-06 01:11:44,363 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-06 01:11:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-06 01:11:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 01:11:44,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:44,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:44,375 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1708036412, now seen corresponding path program 1 times [2020-10-06 01:11:44,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:44,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148295486] [2020-10-06 01:11:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:44,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148295486] [2020-10-06 01:11:44,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:44,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:11:44,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1325962276] [2020-10-06 01:11:44,668 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:44,672 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:44,690 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 01:11:44,690 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:44,698 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:44,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:11:44,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:44,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:11:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:44,718 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-06 01:11:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:44,812 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-06 01:11:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:11:44,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 01:11:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:44,836 INFO L225 Difference]: With dead ends: 550 [2020-10-06 01:11:44,836 INFO L226 Difference]: Without dead ends: 450 [2020-10-06 01:11:44,837 INFO L675 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 [2020-10-06 01:11:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-06 01:11:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-06 01:11:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-06 01:11:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-06 01:11:44,926 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-06 01:11:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:44,930 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-06 01:11:44,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:11:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-06 01:11:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:11:44,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:44,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:44,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:11:44,935 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 745532085, now seen corresponding path program 1 times [2020-10-06 01:11:44,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:44,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236392566] [2020-10-06 01:11:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:45,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236392566] [2020-10-06 01:11:45,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:45,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:11:45,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1780795050] [2020-10-06 01:11:45,070 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:45,071 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:45,073 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:11:45,073 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:45,074 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:45,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:11:45,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:11:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:45,076 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-06 01:11:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:45,092 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-06 01:11:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:11:45,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 01:11:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:45,099 INFO L225 Difference]: With dead ends: 440 [2020-10-06 01:11:45,099 INFO L226 Difference]: Without dead ends: 440 [2020-10-06 01:11:45,100 INFO L675 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 [2020-10-06 01:11:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-06 01:11:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-06 01:11:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-06 01:11:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-06 01:11:45,131 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-06 01:11:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:45,132 INFO L479 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-06 01:11:45,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:11:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-06 01:11:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:11:45,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:45,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:45,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:11:45,134 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:45,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1113659616, now seen corresponding path program 1 times [2020-10-06 01:11:45,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:45,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417222990] [2020-10-06 01:11:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:45,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417222990] [2020-10-06 01:11:45,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:45,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:11:45,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1683706176] [2020-10-06 01:11:45,265 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:45,266 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:45,269 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-06 01:11:45,269 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:45,312 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:45,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:11:45,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:11:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:45,314 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-06 01:11:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:45,326 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-10-06 01:11:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:11:45,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-06 01:11:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:45,332 INFO L225 Difference]: With dead ends: 432 [2020-10-06 01:11:45,332 INFO L226 Difference]: Without dead ends: 432 [2020-10-06 01:11:45,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-06 01:11:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-10-06 01:11:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-06 01:11:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1290 transitions. [2020-10-06 01:11:45,353 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1290 transitions. Word has length 10 [2020-10-06 01:11:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:45,353 INFO L479 AbstractCegarLoop]: Abstraction has 432 states and 1290 transitions. [2020-10-06 01:11:45,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:11:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1290 transitions. [2020-10-06 01:11:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:11:45,356 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:45,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:45,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:11:45,356 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash 163709616, now seen corresponding path program 1 times [2020-10-06 01:11:45,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:45,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006839479] [2020-10-06 01:11:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:45,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006839479] [2020-10-06 01:11:45,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:45,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:11:45,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760021863] [2020-10-06 01:11:45,503 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:45,506 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:45,510 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 45 transitions. [2020-10-06 01:11:45,510 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:45,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:45,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:45,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,597 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:45,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:45,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,601 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:45,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,646 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:45,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:45,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:45,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,683 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:45,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:45,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:45,771 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:45,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:11:45,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:11:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:45,772 INFO L87 Difference]: Start difference. First operand 432 states and 1290 transitions. Second operand 3 states. [2020-10-06 01:11:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:45,810 INFO L93 Difference]: Finished difference Result 418 states and 1242 transitions. [2020-10-06 01:11:45,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:11:45,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 01:11:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:45,815 INFO L225 Difference]: With dead ends: 418 [2020-10-06 01:11:45,815 INFO L226 Difference]: Without dead ends: 418 [2020-10-06 01:11:45,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-10-06 01:11:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-10-06 01:11:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-06 01:11:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1242 transitions. [2020-10-06 01:11:45,832 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1242 transitions. Word has length 11 [2020-10-06 01:11:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:45,832 INFO L479 AbstractCegarLoop]: Abstraction has 418 states and 1242 transitions. [2020-10-06 01:11:45,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:11:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1242 transitions. [2020-10-06 01:11:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 01:11:45,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:45,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:45,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:11:45,835 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 760956636, now seen corresponding path program 1 times [2020-10-06 01:11:45,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:45,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198931548] [2020-10-06 01:11:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:45,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198931548] [2020-10-06 01:11:45,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:45,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:11:45,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216551080] [2020-10-06 01:11:45,887 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:45,889 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:45,894 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 39 transitions. [2020-10-06 01:11:45,894 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:45,919 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:45,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:11:45,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:11:45,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:45,920 INFO L87 Difference]: Start difference. First operand 418 states and 1242 transitions. Second operand 3 states. [2020-10-06 01:11:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:45,941 INFO L93 Difference]: Finished difference Result 583 states and 1667 transitions. [2020-10-06 01:11:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:11:45,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-06 01:11:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:45,945 INFO L225 Difference]: With dead ends: 583 [2020-10-06 01:11:45,946 INFO L226 Difference]: Without dead ends: 448 [2020-10-06 01:11:45,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:11:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-06 01:11:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 406. [2020-10-06 01:11:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-10-06 01:11:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1156 transitions. [2020-10-06 01:11:45,961 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1156 transitions. Word has length 12 [2020-10-06 01:11:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:45,962 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 1156 transitions. [2020-10-06 01:11:45,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:11:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1156 transitions. [2020-10-06 01:11:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 01:11:45,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:45,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:45,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:11:45,964 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:45,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:45,965 INFO L82 PathProgramCache]: Analyzing trace with hash 761020186, now seen corresponding path program 1 times [2020-10-06 01:11:45,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:45,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648556912] [2020-10-06 01:11:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:46,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648556912] [2020-10-06 01:11:46,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:46,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:11:46,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521700107] [2020-10-06 01:11:46,132 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:46,134 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:46,141 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 65 transitions. [2020-10-06 01:11:46,141 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:46,149 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:46,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:46,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,153 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:46,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,216 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:46,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,276 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:46,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:46,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,283 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:46,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,300 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 01:11:46,301 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:46,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,330 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:46,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,346 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:46,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:11:46,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,391 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:46,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,395 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:46,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,410 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 01:11:46,411 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:46,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,430 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:46,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:46,440 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:46,525 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:46,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:11:46,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:11:46,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:11:46,527 INFO L87 Difference]: Start difference. First operand 406 states and 1156 transitions. Second operand 5 states. [2020-10-06 01:11:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:46,615 INFO L93 Difference]: Finished difference Result 438 states and 1220 transitions. [2020-10-06 01:11:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:11:46,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-06 01:11:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:46,619 INFO L225 Difference]: With dead ends: 438 [2020-10-06 01:11:46,619 INFO L226 Difference]: Without dead ends: 390 [2020-10-06 01:11:46,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:11:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2020-10-06 01:11:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2020-10-06 01:11:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-10-06 01:11:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1079 transitions. [2020-10-06 01:11:46,632 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1079 transitions. Word has length 12 [2020-10-06 01:11:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:46,633 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 1079 transitions. [2020-10-06 01:11:46,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:11:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1079 transitions. [2020-10-06 01:11:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:11:46,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:46,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:46,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:11:46,635 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:46,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:46,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1132943033, now seen corresponding path program 1 times [2020-10-06 01:11:46,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:46,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594048919] [2020-10-06 01:11:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:46,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594048919] [2020-10-06 01:11:46,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:46,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:11:46,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [544183166] [2020-10-06 01:11:46,739 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:46,741 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:46,752 INFO L258 McrAutomatonBuilder]: Finished intersection with 51 states and 101 transitions. [2020-10-06 01:11:46,752 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:46,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:46,974 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9360#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-06 01:11:46,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:11:46,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:11:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:11:46,976 INFO L87 Difference]: Start difference. First operand 390 states and 1079 transitions. Second operand 5 states. [2020-10-06 01:11:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:47,047 INFO L93 Difference]: Finished difference Result 280 states and 683 transitions. [2020-10-06 01:11:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:11:47,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-06 01:11:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:47,049 INFO L225 Difference]: With dead ends: 280 [2020-10-06 01:11:47,050 INFO L226 Difference]: Without dead ends: 176 [2020-10-06 01:11:47,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:11:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-06 01:11:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-06 01:11:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-06 01:11:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-10-06 01:11:47,056 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-10-06 01:11:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:47,056 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-10-06 01:11:47,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:11:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-10-06 01:11:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 01:11:47,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:47,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:47,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:11:47,058 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:47,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:47,059 INFO L82 PathProgramCache]: Analyzing trace with hash -174703217, now seen corresponding path program 1 times [2020-10-06 01:11:47,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:47,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324828451] [2020-10-06 01:11:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:47,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324828451] [2020-10-06 01:11:47,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:47,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:11:47,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [286404788] [2020-10-06 01:11:47,126 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:47,128 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:47,133 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-10-06 01:11:47,134 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:47,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:47,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,152 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:47,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,165 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:47,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:47,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,196 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:47,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,223 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:47,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,237 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:47,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:11:47,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:11:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:11:47,238 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 5 states. [2020-10-06 01:11:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:47,316 INFO L93 Difference]: Finished difference Result 237 states and 475 transitions. [2020-10-06 01:11:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:11:47,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-06 01:11:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:47,318 INFO L225 Difference]: With dead ends: 237 [2020-10-06 01:11:47,318 INFO L226 Difference]: Without dead ends: 161 [2020-10-06 01:11:47,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:11:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-06 01:11:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2020-10-06 01:11:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-06 01:11:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 291 transitions. [2020-10-06 01:11:47,324 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 291 transitions. Word has length 16 [2020-10-06 01:11:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:47,324 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 291 transitions. [2020-10-06 01:11:47,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:11:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 291 transitions. [2020-10-06 01:11:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:11:47,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:47,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:47,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:11:47,325 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1133511140, now seen corresponding path program 1 times [2020-10-06 01:11:47,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:47,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017561423] [2020-10-06 01:11:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:47,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017561423] [2020-10-06 01:11:47,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:47,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:11:47,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1806928631] [2020-10-06 01:11:47,444 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:47,448 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:47,465 INFO L258 McrAutomatonBuilder]: Finished intersection with 57 states and 96 transitions. [2020-10-06 01:11:47,465 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:47,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,546 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:47,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:11:47,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:47,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:11:47,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:11:47,548 INFO L87 Difference]: Start difference. First operand 153 states and 291 transitions. Second operand 6 states. [2020-10-06 01:11:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:47,615 INFO L93 Difference]: Finished difference Result 136 states and 257 transitions. [2020-10-06 01:11:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:11:47,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-06 01:11:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:47,619 INFO L225 Difference]: With dead ends: 136 [2020-10-06 01:11:47,619 INFO L226 Difference]: Without dead ends: 47 [2020-10-06 01:11:47,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:11:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-06 01:11:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-06 01:11:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-06 01:11:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-06 01:11:47,622 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 17 [2020-10-06 01:11:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:47,622 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-06 01:11:47,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:11:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-06 01:11:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 01:11:47,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:47,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:47,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:11:47,624 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1234276180, now seen corresponding path program 1 times [2020-10-06 01:11:47,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:47,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142289116] [2020-10-06 01:11:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:11:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:11:47,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142289116] [2020-10-06 01:11:47,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:11:47,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:11:47,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273192017] [2020-10-06 01:11:47,909 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:11:47,912 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:11:47,929 INFO L258 McrAutomatonBuilder]: Finished intersection with 70 states and 119 transitions. [2020-10-06 01:11:47,929 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:11:47,943 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-06 01:11:47,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,944 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-06 01:11:47,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,946 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:47,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:47,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,963 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:47,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:47,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:47,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:47,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:48,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,023 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:11:48,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:48,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:48,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:48,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:11:48,063 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:48,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,076 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:48,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:48,089 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:11:48,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:11:48,102 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:48,111 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:48,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:48,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,173 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:48,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,199 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:48,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:48,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,257 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:11:48,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:11:48,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,285 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:11:48,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,300 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:11:48,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:11:48,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:11:48,344 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:11:48,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:11:48,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:11:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:11:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:11:48,346 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 6 states. [2020-10-06 01:11:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:11:48,500 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2020-10-06 01:11:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:11:48,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-06 01:11:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:11:48,502 INFO L225 Difference]: With dead ends: 61 [2020-10-06 01:11:48,502 INFO L226 Difference]: Without dead ends: 35 [2020-10-06 01:11:48,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:11:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-06 01:11:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-06 01:11:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-06 01:11:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-06 01:11:48,506 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2020-10-06 01:11:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:11:48,506 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-06 01:11:48,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:11:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-06 01:11:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 01:11:48,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:11:48,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:11:48,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:11:48,508 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:11:48,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:11:48,509 INFO L82 PathProgramCache]: Analyzing trace with hash 70677524, now seen corresponding path program 2 times [2020-10-06 01:11:48,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:11:48,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091699570] [2020-10-06 01:11:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:11:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:11:48,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:11:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:11:48,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:11:48,648 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:11:48,648 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:11:48,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 01:11:48,650 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:11:48,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L2-->L816: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In2055670846 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In2055670846 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In2055670846 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In2055670846 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~y$r_buff1_thd0~0_In2055670846 ~y$r_buff1_thd0~0_Out2055670846) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2055670846 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2055670846|) (or (and .cse0 (= ~y$w_buff1_used~0_Out2055670846 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out2055670846 ~y$w_buff1_used~0_In2055670846))) (or (and (or (and (= ~y$w_buff1~0_In2055670846 ~y~0_Out2055670846) .cse0 .cse1) (and .cse2 (= ~y~0_In2055670846 ~y~0_Out2055670846))) .cse3) (and .cse4 (= ~y$w_buff0~0_In2055670846 ~y~0_Out2055670846) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2055670846 0)) (or (and (= ~y$w_buff0_used~0_Out2055670846 0) .cse4 .cse5) (and (= ~y$w_buff0_used~0_Out2055670846 ~y$w_buff0_used~0_In2055670846) .cse3)) (= ~y$r_buff0_thd0~0_In2055670846 ~y$r_buff0_thd0~0_Out2055670846)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2055670846|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2055670846, ~y$w_buff1~0=~y$w_buff1~0_In2055670846, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2055670846, ~y$w_buff0~0=~y$w_buff0~0_In2055670846, ~y~0=~y~0_In2055670846, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2055670846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2055670846} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out2055670846, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out2055670846|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2055670846|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2055670846|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2055670846|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2055670846|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2055670846|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2055670846|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2055670846, ~y$w_buff1~0=~y$w_buff1~0_In2055670846, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out2055670846, ~y$w_buff0~0=~y$w_buff0~0_In2055670846, ~y~0=~y~0_Out2055670846, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2055670846, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out2055670846} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-06 01:11:48,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,673 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:11:48,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:11:48,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:11:48 BasicIcfg [2020-10-06 01:11:48,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:11:48,749 INFO L168 Benchmark]: Toolchain (without parser) took 15153.19 ms. Allocated memory was 138.4 MB in the beginning and 366.5 MB in the end (delta: 228.1 MB). Free memory was 99.6 MB in the beginning and 166.9 MB in the end (delta: -67.3 MB). Peak memory consumption was 160.8 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:48,750 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 01:11:48,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.10 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 99.2 MB in the beginning and 153.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:48,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.78 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 149.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:48,753 INFO L168 Benchmark]: Boogie Preprocessor took 44.72 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:48,754 INFO L168 Benchmark]: RCFGBuilder took 2016.80 ms. Allocated memory was 201.9 MB in the beginning and 250.1 MB in the end (delta: 48.2 MB). Free memory was 147.9 MB in the beginning and 198.5 MB in the end (delta: -50.6 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:48,755 INFO L168 Benchmark]: TraceAbstraction took 12307.21 ms. Allocated memory was 250.1 MB in the beginning and 366.5 MB in the end (delta: 116.4 MB). Free memory was 198.5 MB in the beginning and 166.9 MB in the end (delta: 31.6 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:11:48,759 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 700.10 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 99.2 MB in the beginning and 153.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.78 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 149.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.72 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2016.80 ms. Allocated memory was 201.9 MB in the beginning and 250.1 MB in the end (delta: 48.2 MB). Free memory was 147.9 MB in the beginning and 198.5 MB in the end (delta: -50.6 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12307.21 ms. Allocated memory was 250.1 MB in the beginning and 366.5 MB in the end (delta: 116.4 MB). Free memory was 198.5 MB in the beginning and 166.9 MB in the end (delta: 31.6 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 98 ProgramPointsBefore, 35 ProgramPointsAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 795 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3907 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L705] 0 _Bool y$flush_delayed; [L706] 0 int y$mem_tmp; [L707] 0 _Bool y$r_buff0_thd0; [L708] 0 _Bool y$r_buff0_thd1; [L709] 0 _Bool y$r_buff0_thd2; [L710] 0 _Bool y$r_buff0_thd3; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$r_buff1_thd3; [L715] 0 _Bool y$read_delayed; [L716] 0 int *y$read_delayed_var; [L717] 0 int y$w_buff0; [L718] 0 _Bool y$w_buff0_used; [L719] 0 int y$w_buff1; [L720] 0 _Bool y$w_buff1_used; [L722] 0 int z = 0; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L800] 0 pthread_t t2504; [L801] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2505; [L803] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2506; [L805] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L778] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 3 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L749] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.0s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 203 SDtfs, 173 SDslu, 243 SDs, 0 SdLazy, 157 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 13667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...