/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:46:55,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:46:55,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:46:55,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:46:55,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:46:55,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:46:55,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:46:55,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:46:55,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:46:55,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:46:55,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:46:55,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:46:55,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:46:55,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:46:55,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:46:55,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:46:55,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:46:55,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:46:55,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:46:55,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:46:55,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:46:55,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:46:55,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:46:55,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:46:55,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:46:55,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:46:55,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:46:55,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:46:55,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:46:55,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:46:55,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:46:55,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:46:55,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:46:55,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:46:55,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:46:55,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:46:55,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:46:55,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:46:55,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:46:55,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:46:55,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:46:55,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:46:55,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:46:55,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:46:55,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:46:55,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:46:55,607 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:46:55,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:46:55,607 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:46:55,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:46:55,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:46:55,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:46:55,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:46:55,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:46:55,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:46:55,608 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:46:55,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:46:55,609 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:46:55,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:46:55,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:46:55,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:46:55,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:46:55,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:46:55,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:46:55,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:46:55,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:46:55,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:46:55,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:46:55,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:46:55,611 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:46:55,611 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:46:55,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:46:55,612 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:46:55,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:46:55,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:46:55,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:46:55,910 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:46:55,910 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:46:55,911 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2020-10-16 13:46:55,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/26d3f2773/c8268cdf3ef849e6a578829cba2a5881/FLAGc4f38059f [2020-10-16 13:46:56,527 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:46:56,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2020-10-16 13:46:56,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/26d3f2773/c8268cdf3ef849e6a578829cba2a5881/FLAGc4f38059f [2020-10-16 13:46:56,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/26d3f2773/c8268cdf3ef849e6a578829cba2a5881 [2020-10-16 13:46:56,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:46:56,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:46:56,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:56,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:46:56,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:46:56,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:56" (1/1) ... [2020-10-16 13:46:56,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25971070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:56, skipping insertion in model container [2020-10-16 13:46:56,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:56" (1/1) ... [2020-10-16 13:46:56,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:46:56,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:46:57,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:57,364 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:46:57,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:57,527 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:46:57,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57 WrapperNode [2020-10-16 13:46:57,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:57,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:57,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:46:57,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:46:57,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:57,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:46:57,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:46:57,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:46:57,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... [2020-10-16 13:46:57,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:46:57,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:46:57,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:46:57,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:46:57,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 13:46:57,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:46:57,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:46:57,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:46:57,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:46:57,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:46:57,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:46:57,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:46:57,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:46:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:46:57,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:46:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:46:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:46:57,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:46:57,729 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:46:59,592 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:46:59,593 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:46:59,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:59 BoogieIcfgContainer [2020-10-16 13:46:59,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:46:59,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:46:59,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:46:59,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:46:59,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:46:56" (1/3) ... [2020-10-16 13:46:59,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fda96ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:59, skipping insertion in model container [2020-10-16 13:46:59,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:57" (2/3) ... [2020-10-16 13:46:59,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fda96ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:59, skipping insertion in model container [2020-10-16 13:46:59,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:59" (3/3) ... [2020-10-16 13:46:59,604 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2020-10-16 13:46:59,615 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:46:59,615 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:46:59,623 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:46:59,624 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:46:59,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,654 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,654 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,658 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,658 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,665 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,665 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,672 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,672 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,673 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:59,679 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:46:59,692 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:46:59,712 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:46:59,713 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:46:59,713 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:46:59,713 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:46:59,713 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:46:59,713 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:46:59,714 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:46:59,714 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:46:59,727 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:46:59,728 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 13:46:59,730 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 13:46:59,732 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 13:46:59,776 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 13:46:59,776 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:46:59,781 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 13:46:59,784 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 13:47:01,334 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 13:47:01,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:47:01,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:47:01,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:47:01,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:47:02,709 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 13:47:03,265 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 13:47:03,375 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 13:47:04,083 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-16 13:47:04,330 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 13:47:05,279 WARN L193 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-16 13:47:05,555 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 13:47:06,170 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 13:47:06,476 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 13:47:06,788 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 13:47:06,898 INFO L132 LiptonReduction]: Checked pairs total: 4063 [2020-10-16 13:47:06,898 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 13:47:06,905 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 13:47:06,966 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 13:47:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 13:47:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:47:06,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:06,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:06,981 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1708036412, now seen corresponding path program 1 times [2020-10-16 13:47:07,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:07,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627527124] [2020-10-16 13:47:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:07,259 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-16 13:47:07,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627527124] [2020-10-16 13:47:07,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:07,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:47:07,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [120389628] [2020-10-16 13:47:07,262 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:07,266 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:07,284 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:47:07,284 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:07,288 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:07,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:07,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:07,306 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 13:47:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:07,383 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 13:47:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:07,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:47:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:07,404 INFO L225 Difference]: With dead ends: 550 [2020-10-16 13:47:07,405 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 13:47:07,406 INFO L677 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-16 13:47:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 13:47:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 13:47:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 13:47:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 13:47:07,490 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 13:47:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:07,491 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 13:47:07,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 13:47:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:47:07,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:07,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:07,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:47:07,496 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 745532085, now seen corresponding path program 1 times [2020-10-16 13:47:07,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:07,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838988080] [2020-10-16 13:47:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:07,604 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-16 13:47:07,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838988080] [2020-10-16 13:47:07,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:07,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:47:07,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42077263] [2020-10-16 13:47:07,605 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:07,607 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:07,609 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:47:07,609 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:07,610 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:07,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:07,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:07,612 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 13:47:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:07,624 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-16 13:47:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:07,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:47:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:07,632 INFO L225 Difference]: With dead ends: 440 [2020-10-16 13:47:07,632 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 13:47:07,633 INFO L677 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-16 13:47:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 13:47:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-16 13:47:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 13:47:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-16 13:47:07,672 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-16 13:47:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:07,672 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-16 13:47:07,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-16 13:47:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:47:07,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:07,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:07,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:47:07,681 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1113659616, now seen corresponding path program 1 times [2020-10-16 13:47:07,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:07,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142914055] [2020-10-16 13:47:07,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:07,794 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-16 13:47:07,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142914055] [2020-10-16 13:47:07,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:07,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:47:07,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563947191] [2020-10-16 13:47:07,796 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:07,797 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:07,799 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-16 13:47:07,799 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:07,832 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:07,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:07,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:07,833 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-16 13:47:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:07,845 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-10-16 13:47:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:07,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 13:47:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:07,849 INFO L225 Difference]: With dead ends: 432 [2020-10-16 13:47:07,849 INFO L226 Difference]: Without dead ends: 432 [2020-10-16 13:47:07,850 INFO L677 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-16 13:47:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-16 13:47:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-10-16 13:47:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-16 13:47:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1290 transitions. [2020-10-16 13:47:07,864 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1290 transitions. Word has length 10 [2020-10-16 13:47:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:07,865 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1290 transitions. [2020-10-16 13:47:07,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1290 transitions. [2020-10-16 13:47:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:47:07,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:07,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:07,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:47:07,868 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash 163709616, now seen corresponding path program 1 times [2020-10-16 13:47:07,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:07,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185241050] [2020-10-16 13:47:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:07,997 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-16 13:47:07,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185241050] [2020-10-16 13:47:07,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:07,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:47:07,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734041549] [2020-10-16 13:47:07,999 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:08,000 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:08,004 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 45 transitions. [2020-10-16 13:47:08,004 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:08,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:08,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:08,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,079 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:08,105 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:08,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:08,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,108 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:08,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,153 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:08,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,162 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:08,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:08,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,182 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:08,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,211 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:08,262 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:08,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:47:08,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:08,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:47:08,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:47:08,263 INFO L87 Difference]: Start difference. First operand 432 states and 1290 transitions. Second operand 4 states. [2020-10-16 13:47:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:08,321 INFO L93 Difference]: Finished difference Result 416 states and 1232 transitions. [2020-10-16 13:47:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:47:08,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:47:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:08,326 INFO L225 Difference]: With dead ends: 416 [2020-10-16 13:47:08,326 INFO L226 Difference]: Without dead ends: 416 [2020-10-16 13:47:08,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:47:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-10-16 13:47:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2020-10-16 13:47:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-16 13:47:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1232 transitions. [2020-10-16 13:47:08,340 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1232 transitions. Word has length 11 [2020-10-16 13:47:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:08,340 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1232 transitions. [2020-10-16 13:47:08,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:47:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1232 transitions. [2020-10-16 13:47:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:47:08,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:08,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:08,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:47:08,343 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash 779984560, now seen corresponding path program 1 times [2020-10-16 13:47:08,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:08,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414005840] [2020-10-16 13:47:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:08,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-16 13:47:08,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414005840] [2020-10-16 13:47:08,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:08,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:47:08,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [533764409] [2020-10-16 13:47:08,447 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:08,449 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:08,453 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 48 transitions. [2020-10-16 13:47:08,453 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:08,465 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:08,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,530 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:08,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,590 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:08,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:47:08,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:47:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:47:08,591 INFO L87 Difference]: Start difference. First operand 416 states and 1232 transitions. Second operand 4 states. [2020-10-16 13:47:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:08,647 INFO L93 Difference]: Finished difference Result 420 states and 1243 transitions. [2020-10-16 13:47:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:47:08,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 13:47:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:08,652 INFO L225 Difference]: With dead ends: 420 [2020-10-16 13:47:08,652 INFO L226 Difference]: Without dead ends: 420 [2020-10-16 13:47:08,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:47:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-16 13:47:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-10-16 13:47:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-16 13:47:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1243 transitions. [2020-10-16 13:47:08,667 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1243 transitions. Word has length 12 [2020-10-16 13:47:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:08,667 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1243 transitions. [2020-10-16 13:47:08,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:47:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1243 transitions. [2020-10-16 13:47:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:47:08,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:08,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:08,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:47:08,670 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:08,670 INFO L82 PathProgramCache]: Analyzing trace with hash 777822310, now seen corresponding path program 2 times [2020-10-16 13:47:08,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:08,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925111130] [2020-10-16 13:47:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:08,746 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-16 13:47:08,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925111130] [2020-10-16 13:47:08,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:08,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:08,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834936584] [2020-10-16 13:47:08,747 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:08,749 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:08,753 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-10-16 13:47:08,753 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:08,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:08,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,762 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:08,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,764 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:08,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,780 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:08,861 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:08,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:47:08,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:47:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:08,863 INFO L87 Difference]: Start difference. First operand 420 states and 1243 transitions. Second operand 5 states. [2020-10-16 13:47:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:08,906 INFO L93 Difference]: Finished difference Result 411 states and 1213 transitions. [2020-10-16 13:47:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:47:08,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 13:47:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:08,910 INFO L225 Difference]: With dead ends: 411 [2020-10-16 13:47:08,910 INFO L226 Difference]: Without dead ends: 411 [2020-10-16 13:47:08,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-16 13:47:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-10-16 13:47:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-16 13:47:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1202 transitions. [2020-10-16 13:47:08,922 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1202 transitions. Word has length 12 [2020-10-16 13:47:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:08,922 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1202 transitions. [2020-10-16 13:47:08,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:47:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1202 transitions. [2020-10-16 13:47:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:08,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:08,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:08,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:47:08,924 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2114756535, now seen corresponding path program 1 times [2020-10-16 13:47:08,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:08,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073458685] [2020-10-16 13:47:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:08,969 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-16 13:47:08,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073458685] [2020-10-16 13:47:08,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:08,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:47:08,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63318776] [2020-10-16 13:47:08,970 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:08,973 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:08,977 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 42 transitions. [2020-10-16 13:47:08,978 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:09,014 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:09,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:09,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:09,016 INFO L87 Difference]: Start difference. First operand 407 states and 1202 transitions. Second operand 3 states. [2020-10-16 13:47:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:09,029 INFO L93 Difference]: Finished difference Result 558 states and 1597 transitions. [2020-10-16 13:47:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:09,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 13:47:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:09,034 INFO L225 Difference]: With dead ends: 558 [2020-10-16 13:47:09,034 INFO L226 Difference]: Without dead ends: 423 [2020-10-16 13:47:09,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-16 13:47:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-16 13:47:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 396. [2020-10-16 13:47:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-10-16 13:47:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1120 transitions. [2020-10-16 13:47:09,046 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1120 transitions. Word has length 13 [2020-10-16 13:47:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:09,047 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 1120 transitions. [2020-10-16 13:47:09,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1120 transitions. [2020-10-16 13:47:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:09,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:09,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:09,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:47:09,048 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2116743046, now seen corresponding path program 1 times [2020-10-16 13:47:09,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:09,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121982833] [2020-10-16 13:47:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:09,133 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-16 13:47:09,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121982833] [2020-10-16 13:47:09,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:09,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:09,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418066694] [2020-10-16 13:47:09,134 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:09,136 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:09,143 INFO L258 McrAutomatonBuilder]: Finished intersection with 37 states and 68 transitions. [2020-10-16 13:47:09,143 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:09,162 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:09,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:09,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:09,173 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:09,181 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:47:09,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:09,184 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:09,192 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:47:09,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:09,216 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:09,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:09,226 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:09,230 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:47:09,263 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:09,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:09,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:09,275 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:47:09,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:09,285 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:09,373 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:09,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:47:09,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:47:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:09,375 INFO L87 Difference]: Start difference. First operand 396 states and 1120 transitions. Second operand 5 states. [2020-10-16 13:47:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:09,457 INFO L93 Difference]: Finished difference Result 438 states and 1233 transitions. [2020-10-16 13:47:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:47:09,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 13:47:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:09,461 INFO L225 Difference]: With dead ends: 438 [2020-10-16 13:47:09,461 INFO L226 Difference]: Without dead ends: 438 [2020-10-16 13:47:09,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-16 13:47:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 416. [2020-10-16 13:47:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-16 13:47:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1168 transitions. [2020-10-16 13:47:09,474 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1168 transitions. Word has length 13 [2020-10-16 13:47:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:09,474 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1168 transitions. [2020-10-16 13:47:09,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:47:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1168 transitions. [2020-10-16 13:47:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:09,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:09,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:09,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:47:09,476 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2114580796, now seen corresponding path program 2 times [2020-10-16 13:47:09,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:09,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818778029] [2020-10-16 13:47:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:09,563 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-16 13:47:09,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818778029] [2020-10-16 13:47:09,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:09,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:09,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503360799] [2020-10-16 13:47:09,564 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:09,567 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:09,578 INFO L258 McrAutomatonBuilder]: Finished intersection with 45 states and 90 transitions. [2020-10-16 13:47:09,579 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:09,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:09,584 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:09,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:09,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:09,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:09,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:09,591 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:09,592 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:09,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:09,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:09,861 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [11859#(or (and (= ~y~0 1) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))), 11860#(or (and (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)))] [2020-10-16 13:47:09,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:47:09,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:09,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:47:09,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:09,862 INFO L87 Difference]: Start difference. First operand 416 states and 1168 transitions. Second operand 7 states. [2020-10-16 13:47:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:10,087 INFO L93 Difference]: Finished difference Result 488 states and 1351 transitions. [2020-10-16 13:47:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:47:10,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 13:47:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:10,091 INFO L225 Difference]: With dead ends: 488 [2020-10-16 13:47:10,091 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 13:47:10,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-16 13:47:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 13:47:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 414. [2020-10-16 13:47:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-16 13:47:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1149 transitions. [2020-10-16 13:47:10,105 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1149 transitions. Word has length 13 [2020-10-16 13:47:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:10,105 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1149 transitions. [2020-10-16 13:47:10,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:47:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1149 transitions. [2020-10-16 13:47:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:47:10,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:10,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:10,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:47:10,107 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1132943033, now seen corresponding path program 1 times [2020-10-16 13:47:10,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:10,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935841987] [2020-10-16 13:47:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:10,186 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-16 13:47:10,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935841987] [2020-10-16 13:47:10,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:10,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:10,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1219420041] [2020-10-16 13:47:10,188 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:10,190 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:10,198 INFO L258 McrAutomatonBuilder]: Finished intersection with 51 states and 101 transitions. [2020-10-16 13:47:10,198 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:10,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,374 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13191#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-16 13:47:10,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:47:10,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:10,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:47:10,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:10,375 INFO L87 Difference]: Start difference. First operand 414 states and 1149 transitions. Second operand 5 states. [2020-10-16 13:47:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:10,432 INFO L93 Difference]: Finished difference Result 298 states and 730 transitions. [2020-10-16 13:47:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:47:10,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 13:47:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:10,434 INFO L225 Difference]: With dead ends: 298 [2020-10-16 13:47:10,435 INFO L226 Difference]: Without dead ends: 186 [2020-10-16 13:47:10,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-16 13:47:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-16 13:47:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-16 13:47:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 390 transitions. [2020-10-16 13:47:10,440 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 390 transitions. Word has length 14 [2020-10-16 13:47:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:10,441 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 390 transitions. [2020-10-16 13:47:10,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:47:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 390 transitions. [2020-10-16 13:47:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:47:10,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:10,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:10,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:47:10,442 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash -174703217, now seen corresponding path program 1 times [2020-10-16 13:47:10,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:10,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055050778] [2020-10-16 13:47:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:10,485 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-16 13:47:10,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055050778] [2020-10-16 13:47:10,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:10,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:47:10,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1236522851] [2020-10-16 13:47:10,486 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:10,489 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:10,494 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-10-16 13:47:10,494 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:10,503 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:10,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:10,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:10,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:10,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:10,504 INFO L87 Difference]: Start difference. First operand 186 states and 390 transitions. Second operand 3 states. [2020-10-16 13:47:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:10,513 INFO L93 Difference]: Finished difference Result 253 states and 509 transitions. [2020-10-16 13:47:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:10,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 13:47:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:10,516 INFO L225 Difference]: With dead ends: 253 [2020-10-16 13:47:10,516 INFO L226 Difference]: Without dead ends: 171 [2020-10-16 13:47:10,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 13:47:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-16 13:47:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-10-16 13:47:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-16 13:47:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 303 transitions. [2020-10-16 13:47:10,521 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 303 transitions. Word has length 16 [2020-10-16 13:47:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:10,521 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 303 transitions. [2020-10-16 13:47:10,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 303 transitions. [2020-10-16 13:47:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:47:10,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:10,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:10,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:47:10,523 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1133511140, now seen corresponding path program 1 times [2020-10-16 13:47:10,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:10,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439609897] [2020-10-16 13:47:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:10,611 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-16 13:47:10,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439609897] [2020-10-16 13:47:10,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:10,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:47:10,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1089740268] [2020-10-16 13:47:10,612 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:10,614 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:10,623 INFO L258 McrAutomatonBuilder]: Finished intersection with 57 states and 96 transitions. [2020-10-16 13:47:10,624 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:10,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,674 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:10,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:47:10,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:10,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:47:10,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:47:10,675 INFO L87 Difference]: Start difference. First operand 159 states and 303 transitions. Second operand 6 states. [2020-10-16 13:47:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:10,726 INFO L93 Difference]: Finished difference Result 141 states and 267 transitions. [2020-10-16 13:47:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:47:10,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 13:47:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:10,728 INFO L225 Difference]: With dead ends: 141 [2020-10-16 13:47:10,728 INFO L226 Difference]: Without dead ends: 51 [2020-10-16 13:47:10,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-16 13:47:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2020-10-16 13:47:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-16 13:47:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-16 13:47:10,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 17 [2020-10-16 13:47:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:10,731 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-16 13:47:10,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:47:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-16 13:47:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:47:10,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:10,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:10,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:47:10,732 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1234276180, now seen corresponding path program 1 times [2020-10-16 13:47:10,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:10,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934477848] [2020-10-16 13:47:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:10,888 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-16 13:47:10,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934477848] [2020-10-16 13:47:10,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:10,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:47:10,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084714614] [2020-10-16 13:47:10,891 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:10,893 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:10,945 INFO L258 McrAutomatonBuilder]: Finished intersection with 70 states and 119 transitions. [2020-10-16 13:47:10,945 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:10,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:47:10,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:10,965 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:47:10,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:10,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:10,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:10,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:47:10,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:10,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:10,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:10,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:10,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:10,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:11,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,019 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:11,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:11,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:11,060 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:47:11,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:11,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:11,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:11,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:11,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:11,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:47:11,662 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:47:11,665 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:47:11,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,685 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:11,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,759 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:11,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,783 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:11,791 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:47:11,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,868 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:11,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,884 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:11,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,898 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:11,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:11,903 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:11,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:11,914 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:11,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:11,934 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:11,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:47:11,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:47:11,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:11,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:11,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:11,972 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:47:11,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:12,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:12,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:12,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:47:12,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:12,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,455 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:12,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,478 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:12,552 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:47:12,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:47:12,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,589 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:47:12,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:47:12,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,617 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:47:12,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:12,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:47:12,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:12,678 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:12,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:47:12,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:12,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:47:12,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:12,680 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 7 states. [2020-10-16 13:47:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:12,808 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2020-10-16 13:47:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:47:12,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-16 13:47:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:12,810 INFO L225 Difference]: With dead ends: 61 [2020-10-16 13:47:12,810 INFO L226 Difference]: Without dead ends: 35 [2020-10-16 13:47:12,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:47:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-16 13:47:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-16 13:47:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-16 13:47:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-16 13:47:12,813 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2020-10-16 13:47:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:12,813 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-16 13:47:12,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:47:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-16 13:47:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:47:12,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:12,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:12,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:47:12,815 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash 70677524, now seen corresponding path program 2 times [2020-10-16 13:47:12,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:12,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352880663] [2020-10-16 13:47:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:47:12,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:47:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:47:12,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:47:12,936 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:47:12,936 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:47:12,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 13:47:12,938 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:47:12,948 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L2-->L816: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In-1740244834 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-1740244834 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-1740244834 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1740244834 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~y$r_buff0_thd0~0_Out-1740244834 ~y$r_buff0_thd0~0_In-1740244834) (or (and .cse0 .cse1 (= ~y$w_buff0_used~0_Out-1740244834 0)) (and (= ~y$w_buff0_used~0_Out-1740244834 ~y$w_buff0_used~0_In-1740244834) .cse2)) (= ~y$r_buff1_thd0~0_In-1740244834 ~y$r_buff1_thd0~0_Out-1740244834) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1740244834 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1740244834|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1740244834 0)) (or (and (or (and .cse3 (= ~y$w_buff1~0_In-1740244834 ~y~0_Out-1740244834) .cse4) (and .cse5 (= ~y~0_Out-1740244834 ~y~0_In-1740244834))) .cse2) (and (= ~y~0_Out-1740244834 ~y$w_buff0~0_In-1740244834) .cse0 .cse1)) (or (and (= ~y$w_buff1_used~0_In-1740244834 ~y$w_buff1_used~0_Out-1740244834) .cse5) (and .cse3 (= ~y$w_buff1_used~0_Out-1740244834 0) .cse4))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1740244834|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1740244834, ~y$w_buff1~0=~y$w_buff1~0_In-1740244834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1740244834, ~y$w_buff0~0=~y$w_buff0~0_In-1740244834, ~y~0=~y~0_In-1740244834, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1740244834, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1740244834} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1740244834, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1740244834|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1740244834|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1740244834|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1740244834|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1740244834|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1740244834|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1740244834|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1740244834, ~y$w_buff1~0=~y$w_buff1~0_In-1740244834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1740244834, ~y$w_buff0~0=~y$w_buff0~0_In-1740244834, ~y~0=~y~0_Out-1740244834, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1740244834, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1740244834} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 13:47:12,955 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-16 13:47:12,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,956 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-16 13:47:12,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,956 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-16 13:47:12,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,957 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-16 13:47:12,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,957 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-16 13:47:12,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,958 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-16 13:47:12,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,959 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-16 13:47:12,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,959 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-16 13:47:12,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,960 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-16 13:47:12,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,960 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-16 13:47:12,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,961 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-16 13:47:12,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,962 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-16 13:47:12,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,962 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-16 13:47:12,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,963 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-16 13:47:12,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,964 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-16 13:47:12,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,964 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-16 13:47:12,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,964 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-16 13:47:12,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,965 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-16 13:47:12,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,965 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-16 13:47:12,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,966 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-16 13:47:12,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,966 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-16 13:47:12,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,966 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-16 13:47:12,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,967 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-16 13:47:12,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,967 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-16 13:47:12,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:12,967 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-16 13:47:12,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:13,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:47:13 BasicIcfg [2020-10-16 13:47:13,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:47:13,023 INFO L168 Benchmark]: Toolchain (without parser) took 16195.97 ms. Allocated memory was 140.5 MB in the beginning and 497.5 MB in the end (delta: 357.0 MB). Free memory was 101.5 MB in the beginning and 406.9 MB in the end (delta: -305.4 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:13,024 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 13:47:13,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.86 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.3 MB in the beginning and 157.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:13,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.08 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 154.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:13,026 INFO L168 Benchmark]: Boogie Preprocessor took 45.54 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:13,027 INFO L168 Benchmark]: RCFGBuilder took 1951.54 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 152.0 MB in the beginning and 193.5 MB in the end (delta: -41.5 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:13,028 INFO L168 Benchmark]: TraceAbstraction took 13424.76 ms. Allocated memory was 247.5 MB in the beginning and 497.5 MB in the end (delta: 250.1 MB). Free memory was 191.8 MB in the beginning and 406.9 MB in the end (delta: -215.2 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:13,032 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 698.86 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.3 MB in the beginning and 157.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.08 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 154.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.54 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1951.54 ms. Allocated memory was 203.9 MB in the beginning and 247.5 MB in the end (delta: 43.5 MB). Free memory was 152.0 MB in the beginning and 193.5 MB in the end (delta: -41.5 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13424.76 ms. Allocated memory was 247.5 MB in the beginning and 497.5 MB in the end (delta: 250.1 MB). Free memory was 191.8 MB in the beginning and 406.9 MB in the end (delta: -215.2 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 801 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.1s, 98 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4063 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L705] 0 _Bool y$flush_delayed; [L706] 0 int y$mem_tmp; [L707] 0 _Bool y$r_buff0_thd0; [L708] 0 _Bool y$r_buff0_thd1; [L709] 0 _Bool y$r_buff0_thd2; [L710] 0 _Bool y$r_buff0_thd3; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$r_buff1_thd3; [L715] 0 _Bool y$read_delayed; [L716] 0 int *y$read_delayed_var; [L717] 0 int y$w_buff0; [L718] 0 _Bool y$w_buff0_used; [L719] 0 int y$w_buff1; [L720] 0 _Bool y$w_buff1_used; [L722] 0 int z = 0; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L800] 0 pthread_t t2498; [L801] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2499; [L803] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2500; [L805] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L778] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 3 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L749] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 289 SDtfs, 238 SDslu, 347 SDs, 0 SdLazy, 212 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 152 SyntacticMatches, 19 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 95 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 12610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...