/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 14:24:07,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 14:24:07,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 14:24:07,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 14:24:07,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 14:24:07,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 14:24:07,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 14:24:07,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 14:24:07,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 14:24:07,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 14:24:07,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 14:24:07,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 14:24:07,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 14:24:07,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 14:24:07,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 14:24:07,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 14:24:07,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 14:24:07,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 14:24:07,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 14:24:07,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 14:24:07,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 14:24:07,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 14:24:07,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 14:24:07,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 14:24:07,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 14:24:07,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 14:24:07,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 14:24:07,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 14:24:07,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 14:24:07,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 14:24:07,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 14:24:07,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 14:24:07,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 14:24:07,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 14:24:07,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 14:24:07,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 14:24:07,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 14:24:07,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 14:24:07,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 14:24:07,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 14:24:07,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 14:24:07,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 14:24:07,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 14:24:07,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 14:24:07,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 14:24:07,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 14:24:07,647 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 14:24:07,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 14:24:07,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 14:24:07,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 14:24:07,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 14:24:07,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 14:24:07,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 14:24:07,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 14:24:07,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 14:24:07,649 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 14:24:07,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 14:24:07,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 14:24:07,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 14:24:07,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 14:24:07,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 14:24:07,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 14:24:07,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 14:24:07,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:24:07,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 14:24:07,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 14:24:07,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 14:24:07,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 14:24:07,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 14:24:07,651 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 14:24:07,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 14:24:07,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 14:24:07,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 14:24:07,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 14:24:07,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 14:24:07,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 14:24:07,985 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 14:24:07,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-27 14:24:08,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe22deafd/137bcb68fe194062bcf742f6e8803018/FLAG631b3c4f6 [2019-12-27 14:24:08,634 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 14:24:08,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-27 14:24:08,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe22deafd/137bcb68fe194062bcf742f6e8803018/FLAG631b3c4f6 [2019-12-27 14:24:08,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe22deafd/137bcb68fe194062bcf742f6e8803018 [2019-12-27 14:24:08,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 14:24:08,889 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 14:24:08,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 14:24:08,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 14:24:08,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 14:24:08,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:24:08" (1/1) ... [2019-12-27 14:24:08,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cf226c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:08, skipping insertion in model container [2019-12-27 14:24:08,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:24:08" (1/1) ... [2019-12-27 14:24:08,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 14:24:08,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 14:24:09,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:24:09,511 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 14:24:09,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:24:09,681 INFO L208 MainTranslator]: Completed translation [2019-12-27 14:24:09,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09 WrapperNode [2019-12-27 14:24:09,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 14:24:09,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 14:24:09,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 14:24:09,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 14:24:09,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 14:24:09,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 14:24:09,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 14:24:09,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 14:24:09,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... [2019-12-27 14:24:09,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 14:24:09,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 14:24:09,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 14:24:09,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 14:24:09,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:24:09,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 14:24:09,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 14:24:09,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 14:24:09,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 14:24:09,862 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 14:24:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 14:24:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 14:24:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 14:24:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 14:24:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 14:24:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 14:24:09,866 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 14:24:10,556 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 14:24:10,558 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 14:24:10,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:24:10 BoogieIcfgContainer [2019-12-27 14:24:10,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 14:24:10,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 14:24:10,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 14:24:10,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 14:24:10,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:24:08" (1/3) ... [2019-12-27 14:24:10,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba836a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:24:10, skipping insertion in model container [2019-12-27 14:24:10,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:24:09" (2/3) ... [2019-12-27 14:24:10,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba836a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:24:10, skipping insertion in model container [2019-12-27 14:24:10,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:24:10" (3/3) ... [2019-12-27 14:24:10,577 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2019-12-27 14:24:10,588 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 14:24:10,589 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 14:24:10,602 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 14:24:10,603 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 14:24:10,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,691 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,691 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:24:10,709 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 14:24:10,731 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 14:24:10,731 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 14:24:10,731 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 14:24:10,731 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 14:24:10,732 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 14:24:10,732 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 14:24:10,732 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 14:24:10,732 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 14:24:10,747 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-27 14:24:12,281 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22493 states. [2019-12-27 14:24:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states. [2019-12-27 14:24:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 14:24:12,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:12,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:12,294 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2054349026, now seen corresponding path program 1 times [2019-12-27 14:24:12,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:12,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279466068] [2019-12-27 14:24:12,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:12,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279466068] [2019-12-27 14:24:12,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:12,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:24:12,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806736480] [2019-12-27 14:24:12,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:24:12,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:24:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:12,704 INFO L87 Difference]: Start difference. First operand 22493 states. Second operand 4 states. [2019-12-27 14:24:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:13,350 INFO L93 Difference]: Finished difference Result 23445 states and 91746 transitions. [2019-12-27 14:24:13,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:24:13,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-27 14:24:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:13,608 INFO L225 Difference]: With dead ends: 23445 [2019-12-27 14:24:13,608 INFO L226 Difference]: Without dead ends: 21269 [2019-12-27 14:24:13,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-12-27 14:24:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 21269. [2019-12-27 14:24:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-12-27 14:24:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 83770 transitions. [2019-12-27 14:24:15,674 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 83770 transitions. Word has length 36 [2019-12-27 14:24:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:15,675 INFO L462 AbstractCegarLoop]: Abstraction has 21269 states and 83770 transitions. [2019-12-27 14:24:15,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:24:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 83770 transitions. [2019-12-27 14:24:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 14:24:15,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:15,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:15,681 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:15,682 INFO L82 PathProgramCache]: Analyzing trace with hash 99870175, now seen corresponding path program 1 times [2019-12-27 14:24:15,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:15,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880406861] [2019-12-27 14:24:15,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:15,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880406861] [2019-12-27 14:24:15,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:15,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:15,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764652678] [2019-12-27 14:24:15,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:15,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:15,833 INFO L87 Difference]: Start difference. First operand 21269 states and 83770 transitions. Second operand 5 states. [2019-12-27 14:24:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:17,236 INFO L93 Difference]: Finished difference Result 34703 states and 129062 transitions. [2019-12-27 14:24:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:24:17,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 14:24:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:17,422 INFO L225 Difference]: With dead ends: 34703 [2019-12-27 14:24:17,423 INFO L226 Difference]: Without dead ends: 34559 [2019-12-27 14:24:17,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:24:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2019-12-27 14:24:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 33059. [2019-12-27 14:24:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33059 states. [2019-12-27 14:24:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33059 states to 33059 states and 123950 transitions. [2019-12-27 14:24:19,623 INFO L78 Accepts]: Start accepts. Automaton has 33059 states and 123950 transitions. Word has length 43 [2019-12-27 14:24:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:19,625 INFO L462 AbstractCegarLoop]: Abstraction has 33059 states and 123950 transitions. [2019-12-27 14:24:19,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 33059 states and 123950 transitions. [2019-12-27 14:24:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 14:24:19,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:19,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:19,630 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash 268512672, now seen corresponding path program 1 times [2019-12-27 14:24:19,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:19,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836179199] [2019-12-27 14:24:19,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:19,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836179199] [2019-12-27 14:24:19,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:19,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:19,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032582701] [2019-12-27 14:24:19,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:19,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:19,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:19,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:19,728 INFO L87 Difference]: Start difference. First operand 33059 states and 123950 transitions. Second operand 5 states. [2019-12-27 14:24:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:20,538 INFO L93 Difference]: Finished difference Result 40211 states and 148619 transitions. [2019-12-27 14:24:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:24:20,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 14:24:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:20,722 INFO L225 Difference]: With dead ends: 40211 [2019-12-27 14:24:20,722 INFO L226 Difference]: Without dead ends: 40051 [2019-12-27 14:24:20,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:24:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40051 states. [2019-12-27 14:24:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40051 to 34632. [2019-12-27 14:24:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34632 states. [2019-12-27 14:24:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34632 states to 34632 states and 129246 transitions. [2019-12-27 14:24:23,117 INFO L78 Accepts]: Start accepts. Automaton has 34632 states and 129246 transitions. Word has length 44 [2019-12-27 14:24:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:23,118 INFO L462 AbstractCegarLoop]: Abstraction has 34632 states and 129246 transitions. [2019-12-27 14:24:23,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34632 states and 129246 transitions. [2019-12-27 14:24:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 14:24:23,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:23,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:23,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2144969569, now seen corresponding path program 1 times [2019-12-27 14:24:23,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:23,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125887396] [2019-12-27 14:24:23,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:23,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125887396] [2019-12-27 14:24:23,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:23,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:23,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189149020] [2019-12-27 14:24:23,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:23,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:23,233 INFO L87 Difference]: Start difference. First operand 34632 states and 129246 transitions. Second operand 6 states. [2019-12-27 14:24:23,847 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 14:24:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:24,469 INFO L93 Difference]: Finished difference Result 45660 states and 166140 transitions. [2019-12-27 14:24:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:24:24,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 14:24:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:24,732 INFO L225 Difference]: With dead ends: 45660 [2019-12-27 14:24:24,732 INFO L226 Difference]: Without dead ends: 45516 [2019-12-27 14:24:24,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 14:24:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45516 states. [2019-12-27 14:24:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45516 to 33595. [2019-12-27 14:24:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33595 states. [2019-12-27 14:24:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33595 states to 33595 states and 125401 transitions. [2019-12-27 14:24:27,194 INFO L78 Accepts]: Start accepts. Automaton has 33595 states and 125401 transitions. Word has length 51 [2019-12-27 14:24:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:27,195 INFO L462 AbstractCegarLoop]: Abstraction has 33595 states and 125401 transitions. [2019-12-27 14:24:27,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 33595 states and 125401 transitions. [2019-12-27 14:24:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 14:24:27,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:27,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:27,229 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1490455740, now seen corresponding path program 1 times [2019-12-27 14:24:27,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:27,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886870344] [2019-12-27 14:24:27,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:27,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886870344] [2019-12-27 14:24:27,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:27,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:27,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752416410] [2019-12-27 14:24:27,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:27,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:27,324 INFO L87 Difference]: Start difference. First operand 33595 states and 125401 transitions. Second operand 6 states. [2019-12-27 14:24:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:28,060 INFO L93 Difference]: Finished difference Result 46067 states and 167834 transitions. [2019-12-27 14:24:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 14:24:28,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 14:24:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:28,519 INFO L225 Difference]: With dead ends: 46067 [2019-12-27 14:24:28,519 INFO L226 Difference]: Without dead ends: 45827 [2019-12-27 14:24:28,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:24:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45827 states. [2019-12-27 14:24:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45827 to 39956. [2019-12-27 14:24:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39956 states. [2019-12-27 14:24:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39956 states to 39956 states and 147325 transitions. [2019-12-27 14:24:31,545 INFO L78 Accepts]: Start accepts. Automaton has 39956 states and 147325 transitions. Word has length 58 [2019-12-27 14:24:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:31,545 INFO L462 AbstractCegarLoop]: Abstraction has 39956 states and 147325 transitions. [2019-12-27 14:24:31,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 39956 states and 147325 transitions. [2019-12-27 14:24:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 14:24:31,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:31,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:31,579 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1015725706, now seen corresponding path program 1 times [2019-12-27 14:24:31,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:31,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373427421] [2019-12-27 14:24:31,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:31,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373427421] [2019-12-27 14:24:31,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:31,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:24:31,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927568690] [2019-12-27 14:24:31,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:24:31,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:31,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:24:31,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:31,636 INFO L87 Difference]: Start difference. First operand 39956 states and 147325 transitions. Second operand 3 states. [2019-12-27 14:24:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:31,877 INFO L93 Difference]: Finished difference Result 50254 states and 182160 transitions. [2019-12-27 14:24:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:24:31,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-27 14:24:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:31,983 INFO L225 Difference]: With dead ends: 50254 [2019-12-27 14:24:31,984 INFO L226 Difference]: Without dead ends: 50254 [2019-12-27 14:24:31,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50254 states. [2019-12-27 14:24:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50254 to 43886. [2019-12-27 14:24:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43886 states. [2019-12-27 14:24:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43886 states to 43886 states and 160763 transitions. [2019-12-27 14:24:33,046 INFO L78 Accepts]: Start accepts. Automaton has 43886 states and 160763 transitions. Word has length 60 [2019-12-27 14:24:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:33,047 INFO L462 AbstractCegarLoop]: Abstraction has 43886 states and 160763 transitions. [2019-12-27 14:24:33,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:24:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 43886 states and 160763 transitions. [2019-12-27 14:24:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 14:24:33,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:33,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:33,084 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1067966230, now seen corresponding path program 1 times [2019-12-27 14:24:33,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:33,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528629943] [2019-12-27 14:24:33,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:33,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528629943] [2019-12-27 14:24:33,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:33,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:24:33,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984951828] [2019-12-27 14:24:33,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:24:33,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:33,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:24:33,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:33,197 INFO L87 Difference]: Start difference. First operand 43886 states and 160763 transitions. Second operand 7 states. [2019-12-27 14:24:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:34,184 INFO L93 Difference]: Finished difference Result 55882 states and 200497 transitions. [2019-12-27 14:24:34,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 14:24:34,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 14:24:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:34,307 INFO L225 Difference]: With dead ends: 55882 [2019-12-27 14:24:34,307 INFO L226 Difference]: Without dead ends: 55642 [2019-12-27 14:24:34,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 14:24:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55642 states. [2019-12-27 14:24:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55642 to 45112. [2019-12-27 14:24:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45112 states. [2019-12-27 14:24:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45112 states to 45112 states and 164930 transitions. [2019-12-27 14:24:35,661 INFO L78 Accepts]: Start accepts. Automaton has 45112 states and 164930 transitions. Word has length 64 [2019-12-27 14:24:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:35,661 INFO L462 AbstractCegarLoop]: Abstraction has 45112 states and 164930 transitions. [2019-12-27 14:24:35,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:24:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 45112 states and 164930 transitions. [2019-12-27 14:24:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 14:24:35,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:35,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:35,700 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2097396923, now seen corresponding path program 1 times [2019-12-27 14:24:35,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:35,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576493580] [2019-12-27 14:24:35,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:35,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576493580] [2019-12-27 14:24:35,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:35,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:24:35,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765106379] [2019-12-27 14:24:35,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:24:35,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:35,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:24:35,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:35,800 INFO L87 Difference]: Start difference. First operand 45112 states and 164930 transitions. Second operand 7 states. [2019-12-27 14:24:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:37,419 INFO L93 Difference]: Finished difference Result 55096 states and 197674 transitions. [2019-12-27 14:24:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 14:24:37,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 14:24:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:37,540 INFO L225 Difference]: With dead ends: 55096 [2019-12-27 14:24:37,540 INFO L226 Difference]: Without dead ends: 54896 [2019-12-27 14:24:37,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 14:24:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54896 states. [2019-12-27 14:24:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54896 to 45990. [2019-12-27 14:24:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45990 states. [2019-12-27 14:24:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45990 states to 45990 states and 167801 transitions. [2019-12-27 14:24:40,397 INFO L78 Accepts]: Start accepts. Automaton has 45990 states and 167801 transitions. Word has length 65 [2019-12-27 14:24:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:40,397 INFO L462 AbstractCegarLoop]: Abstraction has 45990 states and 167801 transitions. [2019-12-27 14:24:40,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:24:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 45990 states and 167801 transitions. [2019-12-27 14:24:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:24:40,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:40,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:40,433 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash 823868575, now seen corresponding path program 1 times [2019-12-27 14:24:40,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:40,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273909188] [2019-12-27 14:24:40,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:40,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273909188] [2019-12-27 14:24:40,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:40,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:40,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430793473] [2019-12-27 14:24:40,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:40,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:40,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:40,562 INFO L87 Difference]: Start difference. First operand 45990 states and 167801 transitions. Second operand 6 states. [2019-12-27 14:24:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:41,440 INFO L93 Difference]: Finished difference Result 65550 states and 237328 transitions. [2019-12-27 14:24:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:24:41,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 14:24:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:41,603 INFO L225 Difference]: With dead ends: 65550 [2019-12-27 14:24:41,603 INFO L226 Difference]: Without dead ends: 64906 [2019-12-27 14:24:41,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:24:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64906 states. [2019-12-27 14:24:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64906 to 56040. [2019-12-27 14:24:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56040 states. [2019-12-27 14:24:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56040 states to 56040 states and 204331 transitions. [2019-12-27 14:24:43,026 INFO L78 Accepts]: Start accepts. Automaton has 56040 states and 204331 transitions. Word has length 67 [2019-12-27 14:24:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:43,026 INFO L462 AbstractCegarLoop]: Abstraction has 56040 states and 204331 transitions. [2019-12-27 14:24:43,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 56040 states and 204331 transitions. [2019-12-27 14:24:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:24:43,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:43,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:43,076 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1785482592, now seen corresponding path program 1 times [2019-12-27 14:24:43,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:43,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975735366] [2019-12-27 14:24:43,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:43,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975735366] [2019-12-27 14:24:43,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:43,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:24:43,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780135989] [2019-12-27 14:24:43,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:24:43,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:24:43,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:43,188 INFO L87 Difference]: Start difference. First operand 56040 states and 204331 transitions. Second operand 7 states. [2019-12-27 14:24:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:44,774 INFO L93 Difference]: Finished difference Result 83028 states and 292759 transitions. [2019-12-27 14:24:44,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 14:24:44,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 14:24:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:44,953 INFO L225 Difference]: With dead ends: 83028 [2019-12-27 14:24:44,953 INFO L226 Difference]: Without dead ends: 83028 [2019-12-27 14:24:44,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:24:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83028 states. [2019-12-27 14:24:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83028 to 76077. [2019-12-27 14:24:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76077 states. [2019-12-27 14:24:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76077 states to 76077 states and 270626 transitions. [2019-12-27 14:24:46,907 INFO L78 Accepts]: Start accepts. Automaton has 76077 states and 270626 transitions. Word has length 67 [2019-12-27 14:24:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:46,907 INFO L462 AbstractCegarLoop]: Abstraction has 76077 states and 270626 transitions. [2019-12-27 14:24:46,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:24:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 76077 states and 270626 transitions. [2019-12-27 14:24:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:24:46,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:46,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:46,988 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1264720223, now seen corresponding path program 1 times [2019-12-27 14:24:46,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:46,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437578159] [2019-12-27 14:24:46,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:47,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437578159] [2019-12-27 14:24:47,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:47,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:24:47,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561409017] [2019-12-27 14:24:47,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:24:47,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:24:47,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:47,081 INFO L87 Difference]: Start difference. First operand 76077 states and 270626 transitions. Second operand 4 states. [2019-12-27 14:24:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:47,178 INFO L93 Difference]: Finished difference Result 17222 states and 54504 transitions. [2019-12-27 14:24:47,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:24:47,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 14:24:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:47,214 INFO L225 Difference]: With dead ends: 17222 [2019-12-27 14:24:47,214 INFO L226 Difference]: Without dead ends: 16744 [2019-12-27 14:24:47,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2019-12-27 14:24:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16732. [2019-12-27 14:24:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16732 states. [2019-12-27 14:24:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 52999 transitions. [2019-12-27 14:24:47,473 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 52999 transitions. Word has length 67 [2019-12-27 14:24:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:47,473 INFO L462 AbstractCegarLoop]: Abstraction has 16732 states and 52999 transitions. [2019-12-27 14:24:47,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:24:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 52999 transitions. [2019-12-27 14:24:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 14:24:47,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:47,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:47,485 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:47,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash -357405743, now seen corresponding path program 1 times [2019-12-27 14:24:47,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:47,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282585653] [2019-12-27 14:24:47,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:47,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282585653] [2019-12-27 14:24:47,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:47,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:24:47,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373684700] [2019-12-27 14:24:47,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:24:47,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:24:47,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:47,553 INFO L87 Difference]: Start difference. First operand 16732 states and 52999 transitions. Second operand 4 states. [2019-12-27 14:24:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:47,798 INFO L93 Difference]: Finished difference Result 22096 states and 69080 transitions. [2019-12-27 14:24:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:24:47,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-27 14:24:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:47,833 INFO L225 Difference]: With dead ends: 22096 [2019-12-27 14:24:47,833 INFO L226 Difference]: Without dead ends: 22096 [2019-12-27 14:24:47,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22096 states. [2019-12-27 14:24:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22096 to 17608. [2019-12-27 14:24:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17608 states. [2019-12-27 14:24:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17608 states to 17608 states and 55558 transitions. [2019-12-27 14:24:48,208 INFO L78 Accepts]: Start accepts. Automaton has 17608 states and 55558 transitions. Word has length 77 [2019-12-27 14:24:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:48,209 INFO L462 AbstractCegarLoop]: Abstraction has 17608 states and 55558 transitions. [2019-12-27 14:24:48,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:24:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 17608 states and 55558 transitions. [2019-12-27 14:24:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 14:24:48,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:48,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:48,222 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash -612142288, now seen corresponding path program 1 times [2019-12-27 14:24:48,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:48,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439138122] [2019-12-27 14:24:48,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:48,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439138122] [2019-12-27 14:24:48,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:48,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 14:24:48,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183814327] [2019-12-27 14:24:48,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 14:24:48,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:48,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 14:24:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:24:48,338 INFO L87 Difference]: Start difference. First operand 17608 states and 55558 transitions. Second operand 8 states. [2019-12-27 14:24:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:49,538 INFO L93 Difference]: Finished difference Result 19702 states and 61634 transitions. [2019-12-27 14:24:49,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 14:24:49,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-27 14:24:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:49,569 INFO L225 Difference]: With dead ends: 19702 [2019-12-27 14:24:49,570 INFO L226 Difference]: Without dead ends: 19654 [2019-12-27 14:24:49,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 14:24:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-12-27 14:24:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 15526. [2019-12-27 14:24:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15526 states. [2019-12-27 14:24:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15526 states to 15526 states and 49292 transitions. [2019-12-27 14:24:49,812 INFO L78 Accepts]: Start accepts. Automaton has 15526 states and 49292 transitions. Word has length 77 [2019-12-27 14:24:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:49,812 INFO L462 AbstractCegarLoop]: Abstraction has 15526 states and 49292 transitions. [2019-12-27 14:24:49,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 14:24:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15526 states and 49292 transitions. [2019-12-27 14:24:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 14:24:49,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:49,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:49,831 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2124522827, now seen corresponding path program 1 times [2019-12-27 14:24:49,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:49,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550462146] [2019-12-27 14:24:49,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:49,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550462146] [2019-12-27 14:24:49,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:49,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:24:49,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135323014] [2019-12-27 14:24:49,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:24:49,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:49,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:24:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:49,892 INFO L87 Difference]: Start difference. First operand 15526 states and 49292 transitions. Second operand 3 states. [2019-12-27 14:24:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:50,123 INFO L93 Difference]: Finished difference Result 16790 states and 53005 transitions. [2019-12-27 14:24:50,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:24:50,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-27 14:24:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:50,149 INFO L225 Difference]: With dead ends: 16790 [2019-12-27 14:24:50,150 INFO L226 Difference]: Without dead ends: 16790 [2019-12-27 14:24:50,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16790 states. [2019-12-27 14:24:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16790 to 16142. [2019-12-27 14:24:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16142 states. [2019-12-27 14:24:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16142 states to 16142 states and 51106 transitions. [2019-12-27 14:24:50,372 INFO L78 Accepts]: Start accepts. Automaton has 16142 states and 51106 transitions. Word has length 78 [2019-12-27 14:24:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:50,372 INFO L462 AbstractCegarLoop]: Abstraction has 16142 states and 51106 transitions. [2019-12-27 14:24:50,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:24:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 16142 states and 51106 transitions. [2019-12-27 14:24:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 14:24:50,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:50,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:50,386 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:50,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2047654897, now seen corresponding path program 1 times [2019-12-27 14:24:50,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:50,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507006932] [2019-12-27 14:24:50,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:50,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507006932] [2019-12-27 14:24:50,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:50,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:24:50,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950895661] [2019-12-27 14:24:50,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:24:50,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:24:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:50,464 INFO L87 Difference]: Start difference. First operand 16142 states and 51106 transitions. Second operand 4 states. [2019-12-27 14:24:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:50,898 INFO L93 Difference]: Finished difference Result 19270 states and 60152 transitions. [2019-12-27 14:24:50,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:24:50,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-27 14:24:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:50,938 INFO L225 Difference]: With dead ends: 19270 [2019-12-27 14:24:50,939 INFO L226 Difference]: Without dead ends: 19270 [2019-12-27 14:24:50,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19270 states. [2019-12-27 14:24:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19270 to 18247. [2019-12-27 14:24:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-12-27 14:24:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 57268 transitions. [2019-12-27 14:24:51,200 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 57268 transitions. Word has length 79 [2019-12-27 14:24:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:51,201 INFO L462 AbstractCegarLoop]: Abstraction has 18247 states and 57268 transitions. [2019-12-27 14:24:51,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:24:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 57268 transitions. [2019-12-27 14:24:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 14:24:51,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:51,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:51,218 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:51,218 INFO L82 PathProgramCache]: Analyzing trace with hash 111994610, now seen corresponding path program 1 times [2019-12-27 14:24:51,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:51,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873169725] [2019-12-27 14:24:51,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:51,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873169725] [2019-12-27 14:24:51,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:51,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:24:51,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573653489] [2019-12-27 14:24:51,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:24:51,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:24:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:51,252 INFO L87 Difference]: Start difference. First operand 18247 states and 57268 transitions. Second operand 3 states. [2019-12-27 14:24:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:51,593 INFO L93 Difference]: Finished difference Result 19578 states and 61167 transitions. [2019-12-27 14:24:51,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:24:51,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-27 14:24:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:51,636 INFO L225 Difference]: With dead ends: 19578 [2019-12-27 14:24:51,636 INFO L226 Difference]: Without dead ends: 19578 [2019-12-27 14:24:51,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:24:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-27 14:24:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 18919. [2019-12-27 14:24:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18919 states. [2019-12-27 14:24:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18919 states to 18919 states and 59232 transitions. [2019-12-27 14:24:51,936 INFO L78 Accepts]: Start accepts. Automaton has 18919 states and 59232 transitions. Word has length 79 [2019-12-27 14:24:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:51,936 INFO L462 AbstractCegarLoop]: Abstraction has 18919 states and 59232 transitions. [2019-12-27 14:24:51,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:24:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 18919 states and 59232 transitions. [2019-12-27 14:24:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:24:51,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:51,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:51,953 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1909076484, now seen corresponding path program 1 times [2019-12-27 14:24:51,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:51,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580194962] [2019-12-27 14:24:51,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:52,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580194962] [2019-12-27 14:24:52,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:52,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:52,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137769299] [2019-12-27 14:24:52,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:52,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:52,064 INFO L87 Difference]: Start difference. First operand 18919 states and 59232 transitions. Second operand 6 states. [2019-12-27 14:24:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:52,818 INFO L93 Difference]: Finished difference Result 30232 states and 93411 transitions. [2019-12-27 14:24:52,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:24:52,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-27 14:24:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:52,865 INFO L225 Difference]: With dead ends: 30232 [2019-12-27 14:24:52,865 INFO L226 Difference]: Without dead ends: 30232 [2019-12-27 14:24:52,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:24:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30232 states. [2019-12-27 14:24:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30232 to 21553. [2019-12-27 14:24:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21553 states. [2019-12-27 14:24:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21553 states to 21553 states and 66907 transitions. [2019-12-27 14:24:53,394 INFO L78 Accepts]: Start accepts. Automaton has 21553 states and 66907 transitions. Word has length 80 [2019-12-27 14:24:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:53,394 INFO L462 AbstractCegarLoop]: Abstraction has 21553 states and 66907 transitions. [2019-12-27 14:24:53,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 21553 states and 66907 transitions. [2019-12-27 14:24:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:24:53,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:53,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:53,414 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1141126331, now seen corresponding path program 1 times [2019-12-27 14:24:53,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:53,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942078007] [2019-12-27 14:24:53,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:53,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942078007] [2019-12-27 14:24:53,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:53,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:24:53,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342210406] [2019-12-27 14:24:53,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:24:53,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:24:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:24:53,482 INFO L87 Difference]: Start difference. First operand 21553 states and 66907 transitions. Second operand 4 states. [2019-12-27 14:24:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:54,169 INFO L93 Difference]: Finished difference Result 28569 states and 87453 transitions. [2019-12-27 14:24:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:24:54,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-27 14:24:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:54,214 INFO L225 Difference]: With dead ends: 28569 [2019-12-27 14:24:54,214 INFO L226 Difference]: Without dead ends: 28569 [2019-12-27 14:24:54,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28569 states. [2019-12-27 14:24:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28569 to 25906. [2019-12-27 14:24:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25906 states. [2019-12-27 14:24:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25906 states to 25906 states and 79893 transitions. [2019-12-27 14:24:54,590 INFO L78 Accepts]: Start accepts. Automaton has 25906 states and 79893 transitions. Word has length 80 [2019-12-27 14:24:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:54,590 INFO L462 AbstractCegarLoop]: Abstraction has 25906 states and 79893 transitions. [2019-12-27 14:24:54,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:24:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25906 states and 79893 transitions. [2019-12-27 14:24:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:24:54,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:54,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:54,614 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash -502495842, now seen corresponding path program 1 times [2019-12-27 14:24:54,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:54,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336639233] [2019-12-27 14:24:54,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:54,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336639233] [2019-12-27 14:24:54,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:54,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:54,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450450443] [2019-12-27 14:24:54,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:54,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:54,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:54,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:54,706 INFO L87 Difference]: Start difference. First operand 25906 states and 79893 transitions. Second operand 5 states. [2019-12-27 14:24:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:54,835 INFO L93 Difference]: Finished difference Result 26880 states and 82704 transitions. [2019-12-27 14:24:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:24:54,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-27 14:24:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:54,877 INFO L225 Difference]: With dead ends: 26880 [2019-12-27 14:24:54,877 INFO L226 Difference]: Without dead ends: 26880 [2019-12-27 14:24:54,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26880 states. [2019-12-27 14:24:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26880 to 26365. [2019-12-27 14:24:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26365 states. [2019-12-27 14:24:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26365 states to 26365 states and 81218 transitions. [2019-12-27 14:24:55,245 INFO L78 Accepts]: Start accepts. Automaton has 26365 states and 81218 transitions. Word has length 80 [2019-12-27 14:24:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:55,245 INFO L462 AbstractCegarLoop]: Abstraction has 26365 states and 81218 transitions. [2019-12-27 14:24:55,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26365 states and 81218 transitions. [2019-12-27 14:24:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:24:55,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:55,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:55,269 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:55,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1222985055, now seen corresponding path program 1 times [2019-12-27 14:24:55,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:55,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180542307] [2019-12-27 14:24:55,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:55,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180542307] [2019-12-27 14:24:55,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:55,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 14:24:55,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621616600] [2019-12-27 14:24:55,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 14:24:55,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:55,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 14:24:55,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:24:55,386 INFO L87 Difference]: Start difference. First operand 26365 states and 81218 transitions. Second operand 9 states. [2019-12-27 14:24:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:58,400 INFO L93 Difference]: Finished difference Result 47314 states and 142923 transitions. [2019-12-27 14:24:58,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 14:24:58,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-27 14:24:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:58,476 INFO L225 Difference]: With dead ends: 47314 [2019-12-27 14:24:58,476 INFO L226 Difference]: Without dead ends: 46786 [2019-12-27 14:24:58,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-27 14:24:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46786 states. [2019-12-27 14:24:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46786 to 32360. [2019-12-27 14:24:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32360 states. [2019-12-27 14:24:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32360 states to 32360 states and 100100 transitions. [2019-12-27 14:24:59,048 INFO L78 Accepts]: Start accepts. Automaton has 32360 states and 100100 transitions. Word has length 80 [2019-12-27 14:24:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:59,048 INFO L462 AbstractCegarLoop]: Abstraction has 32360 states and 100100 transitions. [2019-12-27 14:24:59,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 14:24:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 32360 states and 100100 transitions. [2019-12-27 14:24:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:24:59,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:59,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:59,078 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1300203548, now seen corresponding path program 1 times [2019-12-27 14:24:59,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:59,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922844766] [2019-12-27 14:24:59,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:59,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922844766] [2019-12-27 14:24:59,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:59,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:59,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128280890] [2019-12-27 14:24:59,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:59,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:59,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:59,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:59,173 INFO L87 Difference]: Start difference. First operand 32360 states and 100100 transitions. Second operand 6 states. [2019-12-27 14:24:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:59,668 INFO L93 Difference]: Finished difference Result 33657 states and 103522 transitions. [2019-12-27 14:24:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:24:59,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-27 14:24:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:59,721 INFO L225 Difference]: With dead ends: 33657 [2019-12-27 14:24:59,721 INFO L226 Difference]: Without dead ends: 33657 [2019-12-27 14:24:59,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:24:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33657 states. [2019-12-27 14:25:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33657 to 32960. [2019-12-27 14:25:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32960 states. [2019-12-27 14:25:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32960 states to 32960 states and 101659 transitions. [2019-12-27 14:25:00,385 INFO L78 Accepts]: Start accepts. Automaton has 32960 states and 101659 transitions. Word has length 80 [2019-12-27 14:25:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:00,385 INFO L462 AbstractCegarLoop]: Abstraction has 32960 states and 101659 transitions. [2019-12-27 14:25:00,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:25:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 32960 states and 101659 transitions. [2019-12-27 14:25:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:25:00,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:00,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:00,416 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 332600451, now seen corresponding path program 1 times [2019-12-27 14:25:00,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:00,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622062704] [2019-12-27 14:25:00,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:00,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622062704] [2019-12-27 14:25:00,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:00,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:25:00,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673163502] [2019-12-27 14:25:00,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:25:00,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:00,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:25:00,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:25:00,509 INFO L87 Difference]: Start difference. First operand 32960 states and 101659 transitions. Second operand 5 states. [2019-12-27 14:25:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:00,556 INFO L93 Difference]: Finished difference Result 4187 states and 10306 transitions. [2019-12-27 14:25:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:25:00,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-27 14:25:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:00,561 INFO L225 Difference]: With dead ends: 4187 [2019-12-27 14:25:00,561 INFO L226 Difference]: Without dead ends: 3449 [2019-12-27 14:25:00,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:25:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2019-12-27 14:25:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3179. [2019-12-27 14:25:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2019-12-27 14:25:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 7713 transitions. [2019-12-27 14:25:00,596 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 7713 transitions. Word has length 80 [2019-12-27 14:25:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:00,596 INFO L462 AbstractCegarLoop]: Abstraction has 3179 states and 7713 transitions. [2019-12-27 14:25:00,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:25:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 7713 transitions. [2019-12-27 14:25:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 14:25:00,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:00,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:00,599 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:00,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:00,599 INFO L82 PathProgramCache]: Analyzing trace with hash -171156109, now seen corresponding path program 1 times [2019-12-27 14:25:00,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:00,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151001565] [2019-12-27 14:25:00,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:00,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151001565] [2019-12-27 14:25:00,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:00,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:25:00,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554274815] [2019-12-27 14:25:00,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:25:00,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:25:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:00,689 INFO L87 Difference]: Start difference. First operand 3179 states and 7713 transitions. Second operand 6 states. [2019-12-27 14:25:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:01,179 INFO L93 Difference]: Finished difference Result 3451 states and 8306 transitions. [2019-12-27 14:25:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:25:01,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-12-27 14:25:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:01,186 INFO L225 Difference]: With dead ends: 3451 [2019-12-27 14:25:01,186 INFO L226 Difference]: Without dead ends: 3393 [2019-12-27 14:25:01,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:25:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2019-12-27 14:25:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3131. [2019-12-27 14:25:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2019-12-27 14:25:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 7597 transitions. [2019-12-27 14:25:01,256 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 7597 transitions. Word has length 90 [2019-12-27 14:25:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:01,257 INFO L462 AbstractCegarLoop]: Abstraction has 3131 states and 7597 transitions. [2019-12-27 14:25:01,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:25:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 7597 transitions. [2019-12-27 14:25:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 14:25:01,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:01,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:01,263 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1799783348, now seen corresponding path program 1 times [2019-12-27 14:25:01,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:01,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808626856] [2019-12-27 14:25:01,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:01,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808626856] [2019-12-27 14:25:01,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:01,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:25:01,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910213250] [2019-12-27 14:25:01,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:25:01,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:25:01,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:25:01,373 INFO L87 Difference]: Start difference. First operand 3131 states and 7597 transitions. Second operand 5 states. [2019-12-27 14:25:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:01,607 INFO L93 Difference]: Finished difference Result 3630 states and 8714 transitions. [2019-12-27 14:25:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:25:01,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-12-27 14:25:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:01,614 INFO L225 Difference]: With dead ends: 3630 [2019-12-27 14:25:01,614 INFO L226 Difference]: Without dead ends: 3589 [2019-12-27 14:25:01,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:25:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2019-12-27 14:25:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3304. [2019-12-27 14:25:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3304 states. [2019-12-27 14:25:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 7985 transitions. [2019-12-27 14:25:01,666 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 7985 transitions. Word has length 90 [2019-12-27 14:25:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:01,667 INFO L462 AbstractCegarLoop]: Abstraction has 3304 states and 7985 transitions. [2019-12-27 14:25:01,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:25:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 7985 transitions. [2019-12-27 14:25:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:01,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:01,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:01,672 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2051379953, now seen corresponding path program 1 times [2019-12-27 14:25:01,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:01,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263143156] [2019-12-27 14:25:01,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:01,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263143156] [2019-12-27 14:25:01,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:01,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:25:01,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792721506] [2019-12-27 14:25:01,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:25:01,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:01,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:25:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:25:01,716 INFO L87 Difference]: Start difference. First operand 3304 states and 7985 transitions. Second operand 4 states. [2019-12-27 14:25:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:01,860 INFO L93 Difference]: Finished difference Result 5040 states and 12287 transitions. [2019-12-27 14:25:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:25:01,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-27 14:25:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:01,867 INFO L225 Difference]: With dead ends: 5040 [2019-12-27 14:25:01,868 INFO L226 Difference]: Without dead ends: 5015 [2019-12-27 14:25:01,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:25:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2019-12-27 14:25:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 3034. [2019-12-27 14:25:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-27 14:25:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 7258 transitions. [2019-12-27 14:25:01,911 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 7258 transitions. Word has length 92 [2019-12-27 14:25:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:01,912 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 7258 transitions. [2019-12-27 14:25:01,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:25:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 7258 transitions. [2019-12-27 14:25:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:01,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:01,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:01,915 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash -175095664, now seen corresponding path program 1 times [2019-12-27 14:25:01,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:01,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234488992] [2019-12-27 14:25:01,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:02,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234488992] [2019-12-27 14:25:02,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:02,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:25:02,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352932253] [2019-12-27 14:25:02,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:25:02,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:25:02,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:25:02,054 INFO L87 Difference]: Start difference. First operand 3034 states and 7258 transitions. Second operand 7 states. [2019-12-27 14:25:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:02,487 INFO L93 Difference]: Finished difference Result 2661 states and 6313 transitions. [2019-12-27 14:25:02,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:25:02,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:25:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:02,493 INFO L225 Difference]: With dead ends: 2661 [2019-12-27 14:25:02,494 INFO L226 Difference]: Without dead ends: 2661 [2019-12-27 14:25:02,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:25:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2019-12-27 14:25:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2605. [2019-12-27 14:25:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-27 14:25:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 6199 transitions. [2019-12-27 14:25:02,546 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 6199 transitions. Word has length 92 [2019-12-27 14:25:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:02,546 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 6199 transitions. [2019-12-27 14:25:02,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:25:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 6199 transitions. [2019-12-27 14:25:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:02,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:02,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:02,550 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash -869143036, now seen corresponding path program 1 times [2019-12-27 14:25:02,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:02,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666691898] [2019-12-27 14:25:02,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:02,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666691898] [2019-12-27 14:25:02,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:02,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:25:02,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433610896] [2019-12-27 14:25:02,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:25:02,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:25:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:02,744 INFO L87 Difference]: Start difference. First operand 2605 states and 6199 transitions. Second operand 6 states. [2019-12-27 14:25:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:02,871 INFO L93 Difference]: Finished difference Result 2899 states and 6768 transitions. [2019-12-27 14:25:02,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:25:02,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:25:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:02,878 INFO L225 Difference]: With dead ends: 2899 [2019-12-27 14:25:02,878 INFO L226 Difference]: Without dead ends: 2871 [2019-12-27 14:25:02,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:25:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-12-27 14:25:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2630. [2019-12-27 14:25:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-12-27 14:25:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 6222 transitions. [2019-12-27 14:25:02,936 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 6222 transitions. Word has length 92 [2019-12-27 14:25:02,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:02,937 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 6222 transitions. [2019-12-27 14:25:02,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:25:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 6222 transitions. [2019-12-27 14:25:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:02,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:02,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:02,943 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:02,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:02,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1404367329, now seen corresponding path program 1 times [2019-12-27 14:25:02,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:02,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291061222] [2019-12-27 14:25:02,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:03,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291061222] [2019-12-27 14:25:03,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:03,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:25:03,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833846621] [2019-12-27 14:25:03,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:25:03,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:03,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:25:03,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:03,043 INFO L87 Difference]: Start difference. First operand 2630 states and 6222 transitions. Second operand 6 states. [2019-12-27 14:25:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:03,323 INFO L93 Difference]: Finished difference Result 4556 states and 11002 transitions. [2019-12-27 14:25:03,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:25:03,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:25:03,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:03,329 INFO L225 Difference]: With dead ends: 4556 [2019-12-27 14:25:03,330 INFO L226 Difference]: Without dead ends: 4556 [2019-12-27 14:25:03,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2019-12-27 14:25:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 2639. [2019-12-27 14:25:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-12-27 14:25:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 6247 transitions. [2019-12-27 14:25:03,378 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 6247 transitions. Word has length 92 [2019-12-27 14:25:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:03,378 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 6247 transitions. [2019-12-27 14:25:03,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:25:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 6247 transitions. [2019-12-27 14:25:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:03,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:03,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:03,382 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1528440576, now seen corresponding path program 1 times [2019-12-27 14:25:03,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:03,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594208445] [2019-12-27 14:25:03,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:03,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594208445] [2019-12-27 14:25:03,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:03,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:25:03,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386752694] [2019-12-27 14:25:03,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:25:03,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:03,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:25:03,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:25:03,504 INFO L87 Difference]: Start difference. First operand 2639 states and 6247 transitions. Second operand 7 states. [2019-12-27 14:25:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:03,924 INFO L93 Difference]: Finished difference Result 3614 states and 8478 transitions. [2019-12-27 14:25:03,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 14:25:03,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:25:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:03,930 INFO L225 Difference]: With dead ends: 3614 [2019-12-27 14:25:03,931 INFO L226 Difference]: Without dead ends: 3578 [2019-12-27 14:25:03,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:25:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2019-12-27 14:25:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 2693. [2019-12-27 14:25:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2019-12-27 14:25:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 6367 transitions. [2019-12-27 14:25:03,962 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 6367 transitions. Word has length 92 [2019-12-27 14:25:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:03,963 INFO L462 AbstractCegarLoop]: Abstraction has 2693 states and 6367 transitions. [2019-12-27 14:25:03,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:25:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 6367 transitions. [2019-12-27 14:25:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:03,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:03,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:03,965 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:03,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1245290112, now seen corresponding path program 1 times [2019-12-27 14:25:03,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:03,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608707170] [2019-12-27 14:25:03,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:04,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608707170] [2019-12-27 14:25:04,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:04,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:25:04,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142556995] [2019-12-27 14:25:04,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:25:04,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:04,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:25:04,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:25:04,054 INFO L87 Difference]: Start difference. First operand 2693 states and 6367 transitions. Second operand 7 states. [2019-12-27 14:25:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:04,397 INFO L93 Difference]: Finished difference Result 3512 states and 8279 transitions. [2019-12-27 14:25:04,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:25:04,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:25:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:04,402 INFO L225 Difference]: With dead ends: 3512 [2019-12-27 14:25:04,403 INFO L226 Difference]: Without dead ends: 3512 [2019-12-27 14:25:04,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:25:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2019-12-27 14:25:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 2929. [2019-12-27 14:25:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2019-12-27 14:25:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 6957 transitions. [2019-12-27 14:25:04,434 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 6957 transitions. Word has length 92 [2019-12-27 14:25:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:04,434 INFO L462 AbstractCegarLoop]: Abstraction has 2929 states and 6957 transitions. [2019-12-27 14:25:04,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:25:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 6957 transitions. [2019-12-27 14:25:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:04,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:04,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:04,437 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1804912703, now seen corresponding path program 1 times [2019-12-27 14:25:04,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:04,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000389621] [2019-12-27 14:25:04,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:04,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000389621] [2019-12-27 14:25:04,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:04,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:25:04,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786471686] [2019-12-27 14:25:04,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:25:04,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:25:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:04,522 INFO L87 Difference]: Start difference. First operand 2929 states and 6957 transitions. Second operand 6 states. [2019-12-27 14:25:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:04,724 INFO L93 Difference]: Finished difference Result 2969 states and 7017 transitions. [2019-12-27 14:25:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:25:04,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:25:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:04,729 INFO L225 Difference]: With dead ends: 2969 [2019-12-27 14:25:04,729 INFO L226 Difference]: Without dead ends: 2969 [2019-12-27 14:25:04,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:25:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2019-12-27 14:25:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2952. [2019-12-27 14:25:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-27 14:25:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 6982 transitions. [2019-12-27 14:25:04,782 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 6982 transitions. Word has length 92 [2019-12-27 14:25:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:04,783 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 6982 transitions. [2019-12-27 14:25:04,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:25:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 6982 transitions. [2019-12-27 14:25:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:04,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:04,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:04,788 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1090876316, now seen corresponding path program 1 times [2019-12-27 14:25:04,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:04,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748501964] [2019-12-27 14:25:04,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:04,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748501964] [2019-12-27 14:25:04,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:04,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:25:04,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938362119] [2019-12-27 14:25:04,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:25:04,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:25:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:25:04,955 INFO L87 Difference]: Start difference. First operand 2952 states and 6982 transitions. Second operand 5 states. [2019-12-27 14:25:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:05,086 INFO L93 Difference]: Finished difference Result 2703 states and 6399 transitions. [2019-12-27 14:25:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:25:05,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-27 14:25:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:05,090 INFO L225 Difference]: With dead ends: 2703 [2019-12-27 14:25:05,090 INFO L226 Difference]: Without dead ends: 2703 [2019-12-27 14:25:05,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-27 14:25:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2653. [2019-12-27 14:25:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-12-27 14:25:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6303 transitions. [2019-12-27 14:25:05,131 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6303 transitions. Word has length 92 [2019-12-27 14:25:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:05,132 INFO L462 AbstractCegarLoop]: Abstraction has 2653 states and 6303 transitions. [2019-12-27 14:25:05,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:25:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6303 transitions. [2019-12-27 14:25:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:25:05,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:05,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:05,136 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1928417086, now seen corresponding path program 1 times [2019-12-27 14:25:05,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:05,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926824230] [2019-12-27 14:25:05,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:05,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926824230] [2019-12-27 14:25:05,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:05,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:25:05,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872697524] [2019-12-27 14:25:05,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:25:05,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:25:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:05,253 INFO L87 Difference]: Start difference. First operand 2653 states and 6303 transitions. Second operand 6 states. [2019-12-27 14:25:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:05,350 INFO L93 Difference]: Finished difference Result 2473 states and 5721 transitions. [2019-12-27 14:25:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:25:05,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:25:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:05,354 INFO L225 Difference]: With dead ends: 2473 [2019-12-27 14:25:05,354 INFO L226 Difference]: Without dead ends: 2473 [2019-12-27 14:25:05,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:25:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-12-27 14:25:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 1816. [2019-12-27 14:25:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-12-27 14:25:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 4273 transitions. [2019-12-27 14:25:05,376 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 4273 transitions. Word has length 92 [2019-12-27 14:25:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:05,376 INFO L462 AbstractCegarLoop]: Abstraction has 1816 states and 4273 transitions. [2019-12-27 14:25:05,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:25:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 4273 transitions. [2019-12-27 14:25:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:25:05,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:05,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:05,379 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:05,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:05,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1154922491, now seen corresponding path program 1 times [2019-12-27 14:25:05,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:05,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205536727] [2019-12-27 14:25:05,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:05,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205536727] [2019-12-27 14:25:05,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:05,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:25:05,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555714778] [2019-12-27 14:25:05,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:25:05,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:05,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:25:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:25:05,470 INFO L87 Difference]: Start difference. First operand 1816 states and 4273 transitions. Second operand 5 states. [2019-12-27 14:25:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:05,642 INFO L93 Difference]: Finished difference Result 2068 states and 4852 transitions. [2019-12-27 14:25:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:25:05,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 14:25:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:05,645 INFO L225 Difference]: With dead ends: 2068 [2019-12-27 14:25:05,646 INFO L226 Difference]: Without dead ends: 2050 [2019-12-27 14:25:05,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:25:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2019-12-27 14:25:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1843. [2019-12-27 14:25:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2019-12-27 14:25:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 4327 transitions. [2019-12-27 14:25:05,670 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 4327 transitions. Word has length 94 [2019-12-27 14:25:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:05,670 INFO L462 AbstractCegarLoop]: Abstraction has 1843 states and 4327 transitions. [2019-12-27 14:25:05,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:25:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 4327 transitions. [2019-12-27 14:25:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:25:05,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:05,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:05,672 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash 89841990, now seen corresponding path program 1 times [2019-12-27 14:25:05,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:05,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727137449] [2019-12-27 14:25:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:05,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727137449] [2019-12-27 14:25:05,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:05,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:25:05,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468076922] [2019-12-27 14:25:05,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:25:05,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:25:05,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:05,765 INFO L87 Difference]: Start difference. First operand 1843 states and 4327 transitions. Second operand 6 states. [2019-12-27 14:25:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:05,822 INFO L93 Difference]: Finished difference Result 2968 states and 7090 transitions. [2019-12-27 14:25:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:25:05,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 14:25:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:05,824 INFO L225 Difference]: With dead ends: 2968 [2019-12-27 14:25:05,824 INFO L226 Difference]: Without dead ends: 1192 [2019-12-27 14:25:05,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:25:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-27 14:25:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-27 14:25:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-27 14:25:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2866 transitions. [2019-12-27 14:25:05,837 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2866 transitions. Word has length 94 [2019-12-27 14:25:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:05,837 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 2866 transitions. [2019-12-27 14:25:05,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:25:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2866 transitions. [2019-12-27 14:25:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:25:05,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:05,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:05,838 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 104916029, now seen corresponding path program 1 times [2019-12-27 14:25:05,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:05,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624766802] [2019-12-27 14:25:05,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:05,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624766802] [2019-12-27 14:25:05,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:05,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:25:05,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946571291] [2019-12-27 14:25:05,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:25:05,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:05,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:25:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:25:05,909 INFO L87 Difference]: Start difference. First operand 1192 states and 2866 transitions. Second operand 5 states. [2019-12-27 14:25:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:05,938 INFO L93 Difference]: Finished difference Result 1192 states and 2845 transitions. [2019-12-27 14:25:05,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:25:05,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 14:25:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:05,940 INFO L225 Difference]: With dead ends: 1192 [2019-12-27 14:25:05,940 INFO L226 Difference]: Without dead ends: 1192 [2019-12-27 14:25:05,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:25:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-27 14:25:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-27 14:25:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-27 14:25:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2845 transitions. [2019-12-27 14:25:05,957 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2845 transitions. Word has length 94 [2019-12-27 14:25:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:05,958 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 2845 transitions. [2019-12-27 14:25:05,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:25:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2845 transitions. [2019-12-27 14:25:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:25:05,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:05,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:05,960 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:05,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:05,960 INFO L82 PathProgramCache]: Analyzing trace with hash -919777892, now seen corresponding path program 2 times [2019-12-27 14:25:05,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:05,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227598375] [2019-12-27 14:25:05,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:25:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:25:06,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227598375] [2019-12-27 14:25:06,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:25:06,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 14:25:06,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143980115] [2019-12-27 14:25:06,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 14:25:06,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:25:06,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 14:25:06,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 14:25:06,124 INFO L87 Difference]: Start difference. First operand 1192 states and 2845 transitions. Second operand 11 states. [2019-12-27 14:25:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:25:06,376 INFO L93 Difference]: Finished difference Result 2291 states and 5520 transitions. [2019-12-27 14:25:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:25:06,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-27 14:25:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:25:06,379 INFO L225 Difference]: With dead ends: 2291 [2019-12-27 14:25:06,379 INFO L226 Difference]: Without dead ends: 1652 [2019-12-27 14:25:06,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 14:25:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-12-27 14:25:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1558. [2019-12-27 14:25:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-12-27 14:25:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 3612 transitions. [2019-12-27 14:25:06,406 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 3612 transitions. Word has length 94 [2019-12-27 14:25:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:25:06,407 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 3612 transitions. [2019-12-27 14:25:06,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 14:25:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 3612 transitions. [2019-12-27 14:25:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:25:06,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:25:06,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:25:06,410 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:25:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:25:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1370490878, now seen corresponding path program 3 times [2019-12-27 14:25:06,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:25:06,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602379342] [2019-12-27 14:25:06,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:25:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:25:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:25:06,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 14:25:06,544 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 14:25:06,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:25:06 BasicIcfg [2019-12-27 14:25:06,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 14:25:06,741 INFO L168 Benchmark]: Toolchain (without parser) took 57852.43 ms. Allocated memory was 137.9 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 101.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 940.7 MB. Max. memory is 7.1 GB. [2019-12-27 14:25:06,742 INFO L168 Benchmark]: CDTParser took 1.59 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 14:25:06,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.65 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 154.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 14:25:06,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 14:25:06,743 INFO L168 Benchmark]: Boogie Preprocessor took 37.44 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 14:25:06,743 INFO L168 Benchmark]: RCFGBuilder took 768.44 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 105.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 14:25:06,744 INFO L168 Benchmark]: TraceAbstraction took 56177.76 ms. Allocated memory was 202.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 105.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 880.1 MB. Max. memory is 7.1 GB. [2019-12-27 14:25:06,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.65 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 154.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.44 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 768.44 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 105.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56177.76 ms. Allocated memory was 202.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 105.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 880.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L699] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L700] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L701] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L702] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L703] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L704] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L705] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L706] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L707] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L708] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L710] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L711] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L712] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 0 pthread_t t2479; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] FCALL, FORK 0 pthread_create(&t2479, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 0 pthread_t t2480; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 2 x$w_buff1 = x$w_buff0 [L741] 2 x$w_buff0 = 2 [L742] 2 x$w_buff1_used = x$w_buff0_used [L743] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 x = x$flush_delayed ? x$mem_tmp : x [L805] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.8s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9973 SDtfs, 9697 SDslu, 23220 SDs, 0 SdLazy, 10525 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 107 SyntacticMatches, 23 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76077occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 111775 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2970 NumberOfCodeBlocks, 2970 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2839 ConstructedInterpolants, 0 QuantifiedInterpolants, 519052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...