/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/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:02:46,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:02:46,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:02:46,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:02:46,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:02:46,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:02:46,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:02:46,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:02:46,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:02:46,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:02:46,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:02:46,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:02:46,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:02:46,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:02:46,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:02:46,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:02:46,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:02:46,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:02:46,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:02:46,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:02:46,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:02:46,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:02:46,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:02:46,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:02:46,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:02:46,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:02:46,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:02:46,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:02:46,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:02:46,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:02:46,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:02:46,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:02:46,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:02:46,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:02:46,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:02:46,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:02:46,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:02:46,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:02:46,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:02:46,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:02:46,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:02:46,346 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:02:46,383 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:02:46,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:02:46,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:02:46,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:02:46,388 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:02:46,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:02:46,388 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:02:46,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:02:46,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:02:46,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:02:46,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:02:46,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:02:46,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:02:46,393 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:02:46,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:02:46,393 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:02:46,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:02:46,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:02:46,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:02:46,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:02:46,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:02:46,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:02:46,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:02:46,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:02:46,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:02:46,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:02:46,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:02:46,397 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:02:46,397 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:02:46,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:02:46,398 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:02:46,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:02:46,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:02:46,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:02:46,736 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:02:46,737 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:02:46,737 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-10-06 01:02:46,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47d5b3b5/bfb8b2546f9b4742837513fd7dfe2f82/FLAG377e445bb [2020-10-06 01:02:47,251 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:02:47,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-10-06 01:02:47,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47d5b3b5/bfb8b2546f9b4742837513fd7dfe2f82/FLAG377e445bb [2020-10-06 01:02:47,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47d5b3b5/bfb8b2546f9b4742837513fd7dfe2f82 [2020-10-06 01:02:47,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:02:47,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:02:47,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:02:47,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:02:47,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:02:47,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:02:47" (1/1) ... [2020-10-06 01:02:47,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51dda2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:47, skipping insertion in model container [2020-10-06 01:02:47,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:02:47" (1/1) ... [2020-10-06 01:02:47,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:02:47,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:02:48,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:02:48,270 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:02:48,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:02:48,446 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:02:48,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48 WrapperNode [2020-10-06 01:02:48,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:02:48,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:02:48,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:02:48,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:02:48,457 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:02:48" (1/1) ... [2020-10-06 01:02:48,478 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:02:48" (1/1) ... [2020-10-06 01:02:48,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:02:48,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:02:48,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:02:48,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:02:48,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (1/1) ... [2020-10-06 01:02:48,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (1/1) ... [2020-10-06 01:02:48,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (1/1) ... [2020-10-06 01:02:48,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (1/1) ... [2020-10-06 01:02:48,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (1/1) ... [2020-10-06 01:02:48,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (1/1) ... [2020-10-06 01:02:48,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (1/1) ... [2020-10-06 01:02:48,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:02:48,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:02:48,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:02:48,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:02:48,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (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:02:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:02:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 01:02:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:02:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:02:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 01:02:48,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 01:02:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 01:02:48,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 01:02:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 01:02:48,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 01:02:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 01:02:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:02:48,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:02:48,635 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:02:50,681 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:02:50,682 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 01:02:50,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:02:50 BoogieIcfgContainer [2020-10-06 01:02:50,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:02:50,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:02:50,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:02:50,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:02:50,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:02:47" (1/3) ... [2020-10-06 01:02:50,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe1dca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:02:50, skipping insertion in model container [2020-10-06 01:02:50,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:48" (2/3) ... [2020-10-06 01:02:50,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe1dca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:02:50, skipping insertion in model container [2020-10-06 01:02:50,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:02:50" (3/3) ... [2020-10-06 01:02:50,693 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2020-10-06 01:02:50,703 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:02:50,704 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:02:50,712 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 01:02:50,713 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:02:50,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,745 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,751 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,751 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:50,787 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 01:02:50,808 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:02:50,809 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:02:50,809 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:02:50,809 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:02:50,809 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:02:50,809 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:02:50,810 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:02:50,810 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:02:50,825 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-06 01:02:50,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-06 01:02:50,873 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-06 01:02:50,874 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:02:50,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-06 01:02:50,882 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-06 01:02:50,904 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-06 01:02:50,904 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:02:50,905 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-06 01:02:50,907 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1650 [2020-10-06 01:02:50,908 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:02:51,382 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-06 01:02:52,698 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-06 01:02:52,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 01:02:52,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:02:52,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-06 01:02:52,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:02:53,884 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-06 01:02:54,309 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-06 01:02:55,920 WARN L193 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-06 01:02:56,185 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-06 01:02:57,572 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-06 01:02:57,942 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-06 01:02:58,148 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-10-06 01:02:58,361 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-06 01:02:58,469 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-06 01:02:58,477 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4568 [2020-10-06 01:02:58,477 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-10-06 01:02:58,481 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-06 01:02:58,532 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-06 01:02:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-06 01:02:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:02:58,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:58,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:02:58,543 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1043102, now seen corresponding path program 1 times [2020-10-06 01:02:58,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:58,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883270437] [2020-10-06 01:02:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:58,782 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:02:58,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883270437] [2020-10-06 01:02:58,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:58,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:58,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962367618] [2020-10-06 01:02:58,785 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:58,788 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:58,800 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:02:58,800 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:58,805 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:58,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:58,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:58,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:58,822 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-06 01:02:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:58,915 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-06 01:02:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:58,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:02:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:58,941 INFO L225 Difference]: With dead ends: 687 [2020-10-06 01:02:58,942 INFO L226 Difference]: Without dead ends: 562 [2020-10-06 01:02:58,943 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:02:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-06 01:02:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-06 01:02:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-06 01:02:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-06 01:02:59,037 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-06 01:02:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:59,038 INFO L479 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-06 01:02:59,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-06 01:02:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:02:59,040 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:59,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:59,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:02:59,073 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash -686129632, now seen corresponding path program 1 times [2020-10-06 01:02:59,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:59,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232151518] [2020-10-06 01:02:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:59,214 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:02:59,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232151518] [2020-10-06 01:02:59,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:59,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:59,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970094039] [2020-10-06 01:02:59,216 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:59,217 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:59,219 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:02:59,219 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:59,220 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:59,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:59,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:59,222 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-06 01:02:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:59,258 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-06 01:02:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:59,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 01:02:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:59,270 INFO L225 Difference]: With dead ends: 557 [2020-10-06 01:02:59,271 INFO L226 Difference]: Without dead ends: 557 [2020-10-06 01:02:59,272 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:02:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-06 01:02:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-06 01:02:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-06 01:02:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-06 01:02:59,305 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-06 01:02:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:59,306 INFO L479 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-06 01:02:59,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-06 01:02:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:02:59,308 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:59,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:59,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:02:59,308 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:59,309 INFO L82 PathProgramCache]: Analyzing trace with hash -801393419, now seen corresponding path program 1 times [2020-10-06 01:02:59,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:59,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780795125] [2020-10-06 01:02:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:59,446 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:02:59,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780795125] [2020-10-06 01:02:59,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:59,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:59,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752883707] [2020-10-06 01:02:59,447 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:59,449 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:59,454 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-06 01:02:59,454 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:59,491 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:59,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:59,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:59,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:59,492 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-06 01:02:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:59,508 INFO L93 Difference]: Finished difference Result 533 states and 1620 transitions. [2020-10-06 01:02:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:59,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-06 01:02:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:59,514 INFO L225 Difference]: With dead ends: 533 [2020-10-06 01:02:59,515 INFO L226 Difference]: Without dead ends: 533 [2020-10-06 01:02:59,515 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:02:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-06 01:02:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-10-06 01:02:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-10-06 01:02:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1620 transitions. [2020-10-06 01:02:59,545 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1620 transitions. Word has length 10 [2020-10-06 01:02:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:59,545 INFO L479 AbstractCegarLoop]: Abstraction has 533 states and 1620 transitions. [2020-10-06 01:02:59,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1620 transitions. [2020-10-06 01:02:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:02:59,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:59,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:59,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:02:59,548 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:59,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 925932103, now seen corresponding path program 1 times [2020-10-06 01:02:59,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:59,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083163891] [2020-10-06 01:02:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:59,642 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:02:59,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083163891] [2020-10-06 01:02:59,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:59,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:59,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441106282] [2020-10-06 01:02:59,644 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:59,646 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:59,649 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 31 transitions. [2020-10-06 01:02:59,649 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:59,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:02:59,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:02:59,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,673 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:59,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,724 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:59,746 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:02:59,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,747 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:02:59,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,769 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:59,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:02:59,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,865 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:02:59,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:59,866 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:59,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,910 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:59,924 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:02:59,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:59,935 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:02:59,970 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:59,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:59,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:59,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:59,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:59,971 INFO L87 Difference]: Start difference. First operand 533 states and 1620 transitions. Second operand 3 states. [2020-10-06 01:03:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:00,016 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions. [2020-10-06 01:03:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:03:00,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 01:03:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:00,021 INFO L225 Difference]: With dead ends: 529 [2020-10-06 01:03:00,021 INFO L226 Difference]: Without dead ends: 529 [2020-10-06 01:03:00,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 1 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:03:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-06 01:03:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2020-10-06 01:03:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-06 01:03:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2020-10-06 01:03:00,041 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 11 [2020-10-06 01:03:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:00,042 INFO L479 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2020-10-06 01:03:00,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:03:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2020-10-06 01:03:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:03:00,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:00,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:00,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:03:00,045 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2033440772, now seen corresponding path program 1 times [2020-10-06 01:03:00,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:00,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253991140] [2020-10-06 01:03:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:00,101 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:03:00,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253991140] [2020-10-06 01:03:00,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:00,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:03:00,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [244627186] [2020-10-06 01:03:00,102 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:00,104 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:00,107 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 17 transitions. [2020-10-06 01:03:00,107 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:00,126 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:00,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:03:00,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:03:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:03:00,127 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 3 states. [2020-10-06 01:03:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:00,143 INFO L93 Difference]: Finished difference Result 525 states and 1590 transitions. [2020-10-06 01:03:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:03:00,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 01:03:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:00,149 INFO L225 Difference]: With dead ends: 525 [2020-10-06 01:03:00,149 INFO L226 Difference]: Without dead ends: 525 [2020-10-06 01:03:00,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:03:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-10-06 01:03:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2020-10-06 01:03:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2020-10-06 01:03:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1590 transitions. [2020-10-06 01:03:00,168 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1590 transitions. Word has length 11 [2020-10-06 01:03:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:00,169 INFO L479 AbstractCegarLoop]: Abstraction has 525 states and 1590 transitions. [2020-10-06 01:03:00,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:03:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1590 transitions. [2020-10-06 01:03:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 01:03:00,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:00,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:00,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:03:00,172 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1362475084, now seen corresponding path program 1 times [2020-10-06 01:03:00,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:00,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688230160] [2020-10-06 01:03:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:00,239 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:03:00,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688230160] [2020-10-06 01:03:00,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:00,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:03:00,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894088859] [2020-10-06 01:03:00,244 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:00,246 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:00,250 INFO L258 McrAutomatonBuilder]: Finished intersection with 23 states and 34 transitions. [2020-10-06 01:03:00,250 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:00,306 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:00,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:03:00,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:03:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:03:00,307 INFO L87 Difference]: Start difference. First operand 525 states and 1590 transitions. Second operand 4 states. [2020-10-06 01:03:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:00,340 INFO L93 Difference]: Finished difference Result 674 states and 2001 transitions. [2020-10-06 01:03:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:03:00,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-06 01:03:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:00,344 INFO L225 Difference]: With dead ends: 674 [2020-10-06 01:03:00,344 INFO L226 Difference]: Without dead ends: 374 [2020-10-06 01:03:00,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:03:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2020-10-06 01:03:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2020-10-06 01:03:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-06 01:03:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions. [2020-10-06 01:03:00,357 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12 [2020-10-06 01:03:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:00,357 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions. [2020-10-06 01:03:00,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:03:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions. [2020-10-06 01:03:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:03:00,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:00,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:00,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:03:00,359 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:00,360 INFO L82 PathProgramCache]: Analyzing trace with hash -80936382, now seen corresponding path program 1 times [2020-10-06 01:03:00,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:00,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428762143] [2020-10-06 01:03:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:00,453 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:03:00,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428762143] [2020-10-06 01:03:00,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:00,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:03:00,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612256050] [2020-10-06 01:03:00,454 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:00,456 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:00,461 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-06 01:03:00,462 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:00,502 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:00,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:03:00,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:00,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:03:00,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:03:00,506 INFO L87 Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand 5 states. [2020-10-06 01:03:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:00,578 INFO L93 Difference]: Finished difference Result 372 states and 1058 transitions. [2020-10-06 01:03:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:03:00,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 01:03:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:00,582 INFO L225 Difference]: With dead ends: 372 [2020-10-06 01:03:00,582 INFO L226 Difference]: Without dead ends: 372 [2020-10-06 01:03:00,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:03:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-10-06 01:03:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 365. [2020-10-06 01:03:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-10-06 01:03:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1036 transitions. [2020-10-06 01:03:00,595 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1036 transitions. Word has length 13 [2020-10-06 01:03:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:00,595 INFO L479 AbstractCegarLoop]: Abstraction has 365 states and 1036 transitions. [2020-10-06 01:03:00,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:03:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1036 transitions. [2020-10-06 01:03:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:03:00,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:00,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:00,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:03:00,597 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:00,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:00,597 INFO L82 PathProgramCache]: Analyzing trace with hash -79337433, now seen corresponding path program 1 times [2020-10-06 01:03:00,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:00,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141288677] [2020-10-06 01:03:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:00,677 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:03:00,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141288677] [2020-10-06 01:03:00,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:00,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:03:00,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582797822] [2020-10-06 01:03:00,679 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:00,680 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:00,685 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 39 transitions. [2020-10-06 01:03:00,685 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:00,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,709 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:00,711 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:00,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,753 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:00,759 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:00,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:00,805 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:00,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:00,875 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:00,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:03:00,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:03:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:03:00,876 INFO L87 Difference]: Start difference. First operand 365 states and 1036 transitions. Second operand 5 states. [2020-10-06 01:03:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:00,955 INFO L93 Difference]: Finished difference Result 395 states and 1124 transitions. [2020-10-06 01:03:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:03:00,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 01:03:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:00,959 INFO L225 Difference]: With dead ends: 395 [2020-10-06 01:03:00,960 INFO L226 Difference]: Without dead ends: 395 [2020-10-06 01:03:00,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:03:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2020-10-06 01:03:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2020-10-06 01:03:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-10-06 01:03:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1124 transitions. [2020-10-06 01:03:00,975 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1124 transitions. Word has length 13 [2020-10-06 01:03:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:00,975 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1124 transitions. [2020-10-06 01:03:00,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:03:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1124 transitions. [2020-10-06 01:03:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:03:00,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:00,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:00,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:03:00,977 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:00,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1785939198, now seen corresponding path program 1 times [2020-10-06 01:03:00,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:00,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801034271] [2020-10-06 01:03:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:01,070 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:03:01,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801034271] [2020-10-06 01:03:01,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:01,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:03:01,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1301384795] [2020-10-06 01:03:01,072 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:01,073 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:01,080 INFO L258 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-10-06 01:03:01,080 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:01,097 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:01,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:03:01,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:03:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:03:01,098 INFO L87 Difference]: Start difference. First operand 395 states and 1124 transitions. Second operand 6 states. [2020-10-06 01:03:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:01,234 INFO L93 Difference]: Finished difference Result 447 states and 1275 transitions. [2020-10-06 01:03:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:03:01,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-06 01:03:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:01,238 INFO L225 Difference]: With dead ends: 447 [2020-10-06 01:03:01,238 INFO L226 Difference]: Without dead ends: 447 [2020-10-06 01:03:01,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:03:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-06 01:03:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-10-06 01:03:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-06 01:03:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1256 transitions. [2020-10-06 01:03:01,252 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1256 transitions. Word has length 14 [2020-10-06 01:03:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:01,253 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1256 transitions. [2020-10-06 01:03:01,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:03:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1256 transitions. [2020-10-06 01:03:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:03:01,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:01,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:01,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:03:01,254 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1835505222, now seen corresponding path program 1 times [2020-10-06 01:03:01,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:01,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793219783] [2020-10-06 01:03:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:01,380 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:03:01,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793219783] [2020-10-06 01:03:01,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:01,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:03:01,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1809129201] [2020-10-06 01:03:01,382 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:01,384 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:01,390 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 42 transitions. [2020-10-06 01:03:01,390 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:01,400 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:01,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:03:01,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:03:01,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,409 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 01:03:01,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:01,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:03:01,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:01,433 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:01,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:01,441 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:01,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:01,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:03:01,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:01,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:01,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:01,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,469 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:01,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:01,471 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:01,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:01,485 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:01,496 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 01:03:01,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,554 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:01,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:01,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:01,610 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:01,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:03:01,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:03:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:03:01,611 INFO L87 Difference]: Start difference. First operand 441 states and 1256 transitions. Second operand 6 states. [2020-10-06 01:03:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:01,694 INFO L93 Difference]: Finished difference Result 437 states and 1242 transitions. [2020-10-06 01:03:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:03:01,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-06 01:03:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:01,698 INFO L225 Difference]: With dead ends: 437 [2020-10-06 01:03:01,699 INFO L226 Difference]: Without dead ends: 437 [2020-10-06 01:03:01,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:03:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-06 01:03:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-10-06 01:03:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-10-06 01:03:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1242 transitions. [2020-10-06 01:03:01,714 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1242 transitions. Word has length 14 [2020-10-06 01:03:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:01,714 INFO L479 AbstractCegarLoop]: Abstraction has 437 states and 1242 transitions. [2020-10-06 01:03:01,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:03:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1242 transitions. [2020-10-06 01:03:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:03:01,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:01,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:01,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:03:01,716 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -470461361, now seen corresponding path program 1 times [2020-10-06 01:03:01,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:01,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341087418] [2020-10-06 01:03:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:01,851 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:03:01,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341087418] [2020-10-06 01:03:01,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:01,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:03:01,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768798022] [2020-10-06 01:03:01,852 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:01,854 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:01,859 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-06 01:03:01,859 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:01,875 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:01,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:03:01,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:03:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:03:01,876 INFO L87 Difference]: Start difference. First operand 437 states and 1242 transitions. Second operand 7 states. [2020-10-06 01:03:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:02,065 INFO L93 Difference]: Finished difference Result 457 states and 1292 transitions. [2020-10-06 01:03:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:03:02,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 01:03:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:02,070 INFO L225 Difference]: With dead ends: 457 [2020-10-06 01:03:02,070 INFO L226 Difference]: Without dead ends: 457 [2020-10-06 01:03:02,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:03:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-10-06 01:03:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 389. [2020-10-06 01:03:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-10-06 01:03:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1094 transitions. [2020-10-06 01:03:02,082 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1094 transitions. Word has length 15 [2020-10-06 01:03:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:02,083 INFO L479 AbstractCegarLoop]: Abstraction has 389 states and 1094 transitions. [2020-10-06 01:03:02,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:03:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1094 transitions. [2020-10-06 01:03:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:03:02,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:02,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:02,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 01:03:02,085 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:02,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash -470461144, now seen corresponding path program 1 times [2020-10-06 01:03:02,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:02,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218971241] [2020-10-06 01:03:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:02,247 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:03:02,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218971241] [2020-10-06 01:03:02,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:02,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:03:02,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983143924] [2020-10-06 01:03:02,249 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:02,252 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:02,295 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-06 01:03:02,296 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:02,316 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:02,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:03:02,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:02,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:03:02,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:03:02,317 INFO L87 Difference]: Start difference. First operand 389 states and 1094 transitions. Second operand 7 states. [2020-10-06 01:03:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:02,453 INFO L93 Difference]: Finished difference Result 484 states and 1364 transitions. [2020-10-06 01:03:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:03:02,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 01:03:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:02,459 INFO L225 Difference]: With dead ends: 484 [2020-10-06 01:03:02,460 INFO L226 Difference]: Without dead ends: 484 [2020-10-06 01:03:02,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:03:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-10-06 01:03:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 429. [2020-10-06 01:03:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-10-06 01:03:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1214 transitions. [2020-10-06 01:03:02,477 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1214 transitions. Word has length 15 [2020-10-06 01:03:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:02,477 INFO L479 AbstractCegarLoop]: Abstraction has 429 states and 1214 transitions. [2020-10-06 01:03:02,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:03:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1214 transitions. [2020-10-06 01:03:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:03:02,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:02,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:02,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 01:03:02,480 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1066077478, now seen corresponding path program 1 times [2020-10-06 01:03:02,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:02,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195711979] [2020-10-06 01:03:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:02,559 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:03:02,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195711979] [2020-10-06 01:03:02,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:02,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:03:02,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [106861099] [2020-10-06 01:03:02,561 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:02,563 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:02,569 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 51 transitions. [2020-10-06 01:03:02,569 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:02,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:03:02,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:02,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,608 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:02,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:03:02,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,633 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:02,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,651 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:03:02,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:03:02,713 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:02,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,752 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:03:02,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:02,782 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:02,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:03:02,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:03:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:03:02,783 INFO L87 Difference]: Start difference. First operand 429 states and 1214 transitions. Second operand 5 states. [2020-10-06 01:03:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:02,848 INFO L93 Difference]: Finished difference Result 609 states and 1691 transitions. [2020-10-06 01:03:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:03:02,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-06 01:03:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:02,851 INFO L225 Difference]: With dead ends: 609 [2020-10-06 01:03:02,851 INFO L226 Difference]: Without dead ends: 321 [2020-10-06 01:03:02,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:03:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-10-06 01:03:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 309. [2020-10-06 01:03:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-10-06 01:03:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 790 transitions. [2020-10-06 01:03:02,860 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 790 transitions. Word has length 15 [2020-10-06 01:03:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:02,861 INFO L479 AbstractCegarLoop]: Abstraction has 309 states and 790 transitions. [2020-10-06 01:03:02,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:03:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 790 transitions. [2020-10-06 01:03:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:03:02,862 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:02,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:02,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 01:03:02,862 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:02,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1795300676, now seen corresponding path program 2 times [2020-10-06 01:03:02,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:02,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103706324] [2020-10-06 01:03:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:02,932 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:03:02,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103706324] [2020-10-06 01:03:02,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:02,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:03:02,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1468192376] [2020-10-06 01:03:02,933 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:02,935 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:02,943 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-10-06 01:03:02,943 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:02,947 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:03:02,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:02,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:03:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:03:02,949 INFO L87 Difference]: Start difference. First operand 309 states and 790 transitions. Second operand 4 states. [2020-10-06 01:03:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:02,983 INFO L93 Difference]: Finished difference Result 304 states and 695 transitions. [2020-10-06 01:03:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:03:02,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-06 01:03:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:02,985 INFO L225 Difference]: With dead ends: 304 [2020-10-06 01:03:02,985 INFO L226 Difference]: Without dead ends: 231 [2020-10-06 01:03:02,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:03:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-10-06 01:03:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2020-10-06 01:03:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-06 01:03:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 520 transitions. [2020-10-06 01:03:02,992 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 520 transitions. Word has length 15 [2020-10-06 01:03:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:02,992 INFO L479 AbstractCegarLoop]: Abstraction has 231 states and 520 transitions. [2020-10-06 01:03:02,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:03:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 520 transitions. [2020-10-06 01:03:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 01:03:02,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:02,993 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:03:02,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-06 01:03:02,993 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash 233532823, now seen corresponding path program 1 times [2020-10-06 01:03:02,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:02,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811368843] [2020-10-06 01:03:02,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:03,066 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:03:03,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811368843] [2020-10-06 01:03:03,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:03,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:03:03,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024550728] [2020-10-06 01:03:03,067 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:03,069 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:03,081 INFO L258 McrAutomatonBuilder]: Finished intersection with 71 states and 133 transitions. [2020-10-06 01:03:03,081 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:03,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:03,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:03,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:03,323 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:03:03,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:03:03,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:03,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:03:03,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:03:03,325 INFO L87 Difference]: Start difference. First operand 231 states and 520 transitions. Second operand 5 states. [2020-10-06 01:03:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:03,375 INFO L93 Difference]: Finished difference Result 198 states and 407 transitions. [2020-10-06 01:03:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:03:03,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-06 01:03:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:03,378 INFO L225 Difference]: With dead ends: 198 [2020-10-06 01:03:03,378 INFO L226 Difference]: Without dead ends: 160 [2020-10-06 01:03:03,379 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 17 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:03:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-06 01:03:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2020-10-06 01:03:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-10-06 01:03:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 323 transitions. [2020-10-06 01:03:03,385 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 323 transitions. Word has length 16 [2020-10-06 01:03:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:03,385 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 323 transitions. [2020-10-06 01:03:03,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:03:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 323 transitions. [2020-10-06 01:03:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-06 01:03:03,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:03,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:03,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-06 01:03:03,387 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1725380069, now seen corresponding path program 1 times [2020-10-06 01:03:03,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:03,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100699949] [2020-10-06 01:03:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:03,575 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:03:03,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100699949] [2020-10-06 01:03:03,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:03,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 01:03:03,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1738716005] [2020-10-06 01:03:03,577 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:03,580 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:03,591 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2020-10-06 01:03:03,592 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:03,707 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [21530#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff1_thd3~0 0))] [2020-10-06 01:03:03,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:03:03,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:03,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:03:03,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:03:03,709 INFO L87 Difference]: Start difference. First operand 160 states and 323 transitions. Second operand 9 states. [2020-10-06 01:03:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:04,022 INFO L93 Difference]: Finished difference Result 191 states and 376 transitions. [2020-10-06 01:03:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:03:04,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-06 01:03:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:04,024 INFO L225 Difference]: With dead ends: 191 [2020-10-06 01:03:04,024 INFO L226 Difference]: Without dead ends: 127 [2020-10-06 01:03:04,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-06 01:03:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-06 01:03:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2020-10-06 01:03:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-06 01:03:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions. [2020-10-06 01:03:04,029 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18 [2020-10-06 01:03:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:04,030 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 249 transitions. [2020-10-06 01:03:04,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:03:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2020-10-06 01:03:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-06 01:03:04,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:04,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:03:04,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-06 01:03:04,032 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash 903386731, now seen corresponding path program 1 times [2020-10-06 01:03:04,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:04,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417560227] [2020-10-06 01:03:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:03:04,145 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:03:04,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417560227] [2020-10-06 01:03:04,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:03:04,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:03:04,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431375304] [2020-10-06 01:03:04,147 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:03:04,152 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:03:04,174 INFO L258 McrAutomatonBuilder]: Finished intersection with 71 states and 124 transitions. [2020-10-06 01:03:04,175 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:03:04,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:03:04,328 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [21982#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 01:03:04,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:03:04,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:03:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:03:04,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:03:04,329 INFO L87 Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 7 states. [2020-10-06 01:03:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:03:04,382 INFO L93 Difference]: Finished difference Result 111 states and 222 transitions. [2020-10-06 01:03:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:03:04,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-06 01:03:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:03:04,384 INFO L225 Difference]: With dead ends: 111 [2020-10-06 01:03:04,384 INFO L226 Difference]: Without dead ends: 62 [2020-10-06 01:03:04,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:03:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-06 01:03:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-06 01:03:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-06 01:03:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-06 01:03:04,387 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-10-06 01:03:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:03:04,387 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-06 01:03:04,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:03:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-06 01:03:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:03:04,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:03:04,388 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, 1] [2020-10-06 01:03:04,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-06 01:03:04,388 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:03:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:03:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -266848583, now seen corresponding path program 1 times [2020-10-06 01:03:04,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:03:04,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601634893] [2020-10-06 01:03:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:03:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:03:04,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:03:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:03:04,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:03:04,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:03:04,503 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:03:04,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-06 01:03:04,504 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:03:04,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L816-->L823: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In2057311271 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In2057311271 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In2057311271 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In2057311271 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In2057311271 ~z$r_buff0_thd0~0_Out2057311271) (or (and .cse0 (= ~z$w_buff0_used~0_In2057311271 ~z$w_buff0_used~0_Out2057311271)) (and .cse1 (= ~z$w_buff0_used~0_Out2057311271 0) .cse2)) (or (and .cse0 (or (and .cse3 (= ~z$w_buff1~0_In2057311271 ~z~0_Out2057311271) .cse4) (and (= ~z~0_In2057311271 ~z~0_Out2057311271) .cse5))) (and .cse1 (= ~z~0_Out2057311271 ~z$w_buff0~0_In2057311271) .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2057311271 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2057311271|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2057311271 0)) (= ~z$r_buff1_thd0~0_Out2057311271 ~z$r_buff1_thd0~0_In2057311271) (or (and (= 0 ~z$w_buff1_used~0_Out2057311271) .cse3 .cse4) (and (= ~z$w_buff1_used~0_In2057311271 ~z$w_buff1_used~0_Out2057311271) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2057311271|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2057311271, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2057311271, ~z$w_buff0~0=~z$w_buff0~0_In2057311271, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2057311271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2057311271, ~z$w_buff1~0=~z$w_buff1~0_In2057311271, ~z~0=~z~0_In2057311271} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2057311271|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out2057311271, ~z$w_buff0~0=~z$w_buff0~0_In2057311271, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out2057311271, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2057311271|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out2057311271|, ~z$w_buff1~0=~z$w_buff1~0_In2057311271, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2057311271|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2057311271|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out2057311271|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2057311271|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out2057311271, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2057311271, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2057311271, ~z~0=~z~0_Out2057311271} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-06 01:03:04,521 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:03:04,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,522 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:03:04,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,522 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:03:04,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,523 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:03:04,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,523 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:03:04,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,523 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:03:04,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,524 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:03:04,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,525 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:03:04,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,525 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:03:04,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,525 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:03:04,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,526 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:03:04,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,526 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:03:04,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,527 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:03:04,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,527 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:03:04,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,527 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:03:04,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,528 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:03:04,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,529 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:03:04,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,529 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:03:04,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,529 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:03:04,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,530 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:03:04,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,530 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:03:04,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,530 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:03:04,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,531 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:03:04,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,531 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:03:04,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,531 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:03:04,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,532 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:03:04,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,532 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:03:04,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,532 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:03:04,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,533 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:03:04,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,533 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:03:04,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,533 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:03:04,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:03:04,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:03:04 BasicIcfg [2020-10-06 01:03:04,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:03:04,589 INFO L168 Benchmark]: Toolchain (without parser) took 17031.39 ms. Allocated memory was 140.5 MB in the beginning and 390.6 MB in the end (delta: 250.1 MB). Free memory was 101.8 MB in the beginning and 220.7 MB in the end (delta: -118.9 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. [2020-10-06 01:03:04,590 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. [2020-10-06 01:03:04,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 886.08 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 156.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2020-10-06 01:03:04,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.97 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 153.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-06 01:03:04,591 INFO L168 Benchmark]: Boogie Preprocessor took 39.10 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:03:04,592 INFO L168 Benchmark]: RCFGBuilder took 2125.02 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 151.6 MB in the beginning and 160.2 MB in the end (delta: -8.7 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:03:04,593 INFO L168 Benchmark]: TraceAbstraction took 13901.38 ms. Allocated memory was 246.9 MB in the beginning and 390.6 MB in the end (delta: 143.7 MB). Free memory was 160.2 MB in the beginning and 220.7 MB in the end (delta: -60.4 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2020-10-06 01:03:04,596 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.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 886.08 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 156.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.97 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 153.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.10 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2125.02 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 151.6 MB in the beginning and 160.2 MB in the end (delta: -8.7 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13901.38 ms. Allocated memory was 246.9 MB in the beginning and 390.6 MB in the end (delta: 143.7 MB). Free memory was 160.2 MB in the beginning and 220.7 MB in the end (delta: -60.4 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.6s, 100 ProgramPointsBefore, 36 ProgramPointsAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 826 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4568 CheckedPairsTotal, 76 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; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L708] 0 int z = 0; [L709] 0 _Bool z$flush_delayed; [L710] 0 int z$mem_tmp; [L711] 0 _Bool z$r_buff0_thd0; [L712] 0 _Bool z$r_buff0_thd1; [L713] 0 _Bool z$r_buff0_thd2; [L714] 0 _Bool z$r_buff0_thd3; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$r_buff1_thd3; [L719] 0 _Bool z$read_delayed; [L720] 0 int *z$read_delayed_var; [L721] 0 int z$w_buff0; [L722] 0 _Bool z$w_buff0_used; [L723] 0 int z$w_buff1; [L724] 0 _Bool z$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2037; [L808] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 0 pthread_t t2038; [L810] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t2039; [L812] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 2 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L765] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L768] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L782] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 z$flush_delayed = weak$$choice2 [L828] 0 z$mem_tmp = z [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L837] 0 z = z$flush_delayed ? z$mem_tmp : z [L838] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 347 SDtfs, 425 SDslu, 598 SDs, 0 SdLazy, 390 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 162 SyntacticMatches, 32 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 151 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 22564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...